1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
// Copyright (c) 2000 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.2-branch/Cartesian_kernel/include/CGAL/Cartesian/Line_3.h $
// $Id: Line_3.h 29078 2006-03-06 13:08:09Z spion $
//
//
// Author(s) : Andreas Fabri
#ifndef CGAL_CARTESIAN_LINE_3_H
#define CGAL_CARTESIAN_LINE_3_H
#include <utility>
#include <CGAL/Handle_for.h>
CGAL_BEGIN_NAMESPACE
template < class R_ >
class LineC3
{
typedef typename R_::RT RT;
typedef typename R_::Point_3 Point_3;
typedef typename R_::Vector_3 Vector_3;
typedef typename R_::Direction_3 Direction_3;
typedef typename R_::Plane_3 Plane_3;
typedef typename R_::Ray_3 Ray_3;
typedef typename R_::Line_3 Line_3;
typedef typename R_::Segment_3 Segment_3;
typedef typename R_::Aff_transformation_3 Aff_transformation_3;
typedef std::pair<Point_3, Vector_3> Rep;
typedef typename R_::template Handle<Rep>::type Base;
Base base;
public:
typedef R_ R;
LineC3() {}
LineC3(const Point_3 &p, const Point_3 &q)
{ *this = R().construct_line_3_object()(p, q); }
LineC3(const Segment_3 &s)
{ *this = R().construct_line_3_object()(s); }
LineC3(const Ray_3 &r)
{ *this = R().construct_line_3_object()(r); }
LineC3(const Point_3 &p, const Vector_3 &v)
: base(p, v) {}
LineC3(const Point_3 &p, const Direction_3 &d)
{ *this = R().construct_line_3_object()(p, d); }
bool operator==(const LineC3 &l) const;
bool operator!=(const LineC3 &l) const;
Plane_3 perpendicular_plane(const Point_3 &p) const;
Line_3 opposite() const;
const Point_3 & point() const
{
return get(base).first;
}
const Vector_3 & to_vector() const
{
return get(base).second;
}
Direction_3 direction() const
{
return Direction_3(to_vector());
}
Point_3 point(int i) const;
Point_3 projection(const Point_3 &p) const;
bool has_on(const Point_3 &p) const;
bool is_degenerate() const;
Line_3 transform(const Aff_transformation_3 &t) const
{
return LineC3<R>(t.transform(point()), t.transform(direction()));
}
};
template < class R >
inline
bool
LineC3<R>::operator==(const LineC3<R> &l) const
{
if (CGAL::identical(base, l.base))
return true;
return has_on(l.point()) && (direction() == l.direction());
}
template < class R >
inline
bool
LineC3<R>::operator!=(const LineC3<R> &l) const
{
return !(*this == l);
}
template < class R >
inline
typename LineC3<R>::Point_3
LineC3<R>::point(int i) const
{ return point() + to_vector()*RT(i); }
template < class R >
inline
typename LineC3<R>::Plane_3
LineC3<R>::
perpendicular_plane(const typename LineC3<R>::Point_3 &p) const
{
return Plane_3(p, to_vector());
}
template < class R >
inline
typename LineC3<R>::Line_3
LineC3<R>::opposite() const
{
return Line_3(point(), -to_vector());
}
template < class R >
inline
typename LineC3<R>::Point_3
LineC3<R>::
projection(const typename LineC3<R>::Point_3 &p) const
{
return R().construct_projected_point_3_object()(*this, p);
}
template < class R >
inline
bool
LineC3<R>::
has_on(const typename LineC3<R>::Point_3 &p) const
{
return collinear(point(), point()+to_vector(), p);
}
template < class R >
inline
bool
LineC3<R>::is_degenerate() const
{ // FIXME : predicate
return to_vector() == NULL_VECTOR;
}
#ifndef CGAL_CARTESIAN_NO_OSTREAM_INSERT_LINEC3
template < class R >
std::ostream &
operator<<(std::ostream &os, const LineC3<R> &l)
{
switch(os.iword(IO::mode)) {
case IO::ASCII :
return os << l.point(0) << ' ' << l.point(1);
case IO::BINARY :
return os << l.point(0) << l.point(1);
default:
return os << "LineC3(" << l.point(0) << ", " << l.point(1) << ")";
}
}
#endif // CGAL_CARTESIAN_NO_OSTREAM_INSERT_LINEC3
#ifndef CGAL_CARTESIAN_NO_ISTREAM_EXTRACT_LINEC3
template < class R >
std::istream &
operator>>(std::istream &is, LineC3<R> &l)
{
typename R::Point_3 p, q;
is >> p >> q;
if (is)
l = LineC3<R>(p, q);
return is;
}
#endif // CGAL_CARTESIAN_NO_ISTREAM_EXTRACT_LINEC3
CGAL_END_NAMESPACE
#endif // CGAL_CARTESIAN_LINE_3_H
|
