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
203
204
205
206
207
208
209
210
211
212
213
214
|
// Copyright (c) 2000
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Cartesian_kernel/include/CGAL/Cartesian/Segment_3.h $
// $Id: include/CGAL/Cartesian/Segment_3.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Andreas Fabri
#ifndef CGAL_CARTESIAN_SEGMENT_3_H
#define CGAL_CARTESIAN_SEGMENT_3_H
#include <CGAL/array.h>
#include <CGAL/Handle_for.h>
namespace CGAL {
template < class R_ >
class SegmentC3
{
typedef typename R_::Boolean Boolean;
typedef typename R_::Point_3 Point_3;
typedef typename R_::Direction_3 Direction_3;
typedef typename R_::Vector_3 Vector_3;
typedef typename R_::Line_3 Line_3;
typedef typename R_::Segment_3 Segment_3;
typedef std::array<Point_3, 2> Rep;
typedef typename R_::template Handle<Rep>::type Base;
Base base;
public:
typedef R_ R;
SegmentC3() {}
SegmentC3(const Point_3 &sp, const Point_3 &ep)
: base{sp, ep} {}
Boolean has_on(const Point_3 &p) const;
Boolean collinear_has_on(const Point_3 &p) const;
Boolean operator==(const SegmentC3 &s) const;
Boolean operator!=(const SegmentC3 &s) const;
const Point_3 & source() const
{
return get_pointee_or_identity(base)[0];
}
const Point_3 & target() const
{
return get_pointee_or_identity(base)[1];
}
const Point_3 & start() const;
const Point_3 & end() const;
const Point_3 & min BOOST_PREVENT_MACRO_SUBSTITUTION () const;
const Point_3 & max BOOST_PREVENT_MACRO_SUBSTITUTION () const;
const Point_3 & vertex(int i) const;
const Point_3 & point(int i) const;
const Point_3 & operator[](int i) const;
Direction_3 direction() const;
Vector_3 to_vector() const;
Line_3 supporting_line() const;
Segment_3 opposite() const;
Boolean is_degenerate() const;
};
template < class R >
inline
typename R::Boolean
SegmentC3<R>::operator==(const SegmentC3<R> &s) const
{
if (CGAL::identical(base, s.base))
return true;
return source() == s.source() && target() == s.target();
}
template < class R >
inline
typename R::Boolean
SegmentC3<R>::operator!=(const SegmentC3<R> &s) const
{
return !(*this == s);
}
template < class R >
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::start() const
{
return source();
}
template < class R >
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::end() const
{
return target();
}
template < class R >
inline
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::min BOOST_PREVENT_MACRO_SUBSTITUTION () const
{
return lexicographically_xyz_smaller(source(),target()) ? source()
: target();
}
template < class R >
inline
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::max BOOST_PREVENT_MACRO_SUBSTITUTION () const
{
return lexicographically_xyz_smaller(source(),target()) ? target()
: source();
}
template < class R >
inline
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::vertex(int i) const
{
return (i%2 == 0) ? source() : target();
}
template < class R >
inline
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::point(int i) const
{
return vertex(i);
}
template < class R >
inline
const typename SegmentC3<R>::Point_3 &
SegmentC3<R>::operator[](int i) const
{
return vertex(i);
}
template < class R >
inline
typename SegmentC3<R>::Vector_3
SegmentC3<R>::to_vector() const
{
return target() - source();
}
template < class R >
inline
typename SegmentC3<R>::Direction_3
SegmentC3<R>::direction() const
{
return Direction_3( target() - source() );
}
template < class R >
inline
typename SegmentC3<R>::Line_3
SegmentC3<R>::supporting_line() const
{
return Line_3(*this);
}
template < class R >
inline
typename SegmentC3<R>::Segment_3
SegmentC3<R>::opposite() const
{
return SegmentC3<R>(target(), source());
}
template < class R >
inline
typename R::Boolean
SegmentC3<R>::is_degenerate() const
{
return source() == target();
}
template < class R >
inline
typename R::Boolean
SegmentC3<R>::
has_on(const typename SegmentC3<R>::Point_3 &p) const
{
return are_ordered_along_line(source(), p, target());
}
template < class R >
inline
typename R::Boolean
SegmentC3<R>::
collinear_has_on(const typename SegmentC3<R>::Point_3 &p) const
{
return collinear_are_ordered_along_line(source(), p, target());
}
} //namespace CGAL
#endif // CGAL_CARTESIAN_SEGMENT_3_H
|
