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
|
// 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); 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; either version 3 of the License,
// or (at your option) any later version.
//
// 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$
// $Id$
//
//
// Author(s) : Geert-Jan Giezeman
#ifndef CGAL_RAY_2_ISO_RECTANGLE_2_INTERSECTION_H
#define CGAL_RAY_2_ISO_RECTANGLE_2_INTERSECTION_H
#include <CGAL/Iso_rectangle_2.h>
#include <CGAL/Ray_2.h>
#include <CGAL/Segment_2.h>
#include <CGAL/Point_2.h>
#include <CGAL/kernel_assertions.h>
#include <CGAL/number_utils.h>
#include <CGAL/Intersection_traits_2.h>
namespace CGAL {
namespace internal {
template <class K>
class Ray_2_Iso_rectangle_2_pair {
public:
enum Intersection_results {NO_INTERSECTION, POINT, SEGMENT};
Ray_2_Iso_rectangle_2_pair(typename K::Ray_2 const *ray,
typename K::Iso_rectangle_2 const *iso)
: _known(false), _ref_point(ray->source()), _dir(ray->direction().to_vector()),
_isomin((iso->min)()), _isomax((iso->max)()), _min((typename K::FT)(0)) {}
Intersection_results intersection_type() const;
typename K::Point_2 intersection_point() const;
typename K::Segment_2 intersection_segment() const;
protected:
mutable bool _known;
mutable Intersection_results _result;
mutable typename K::Point_2 _ref_point;
mutable typename K::Vector_2 _dir;
mutable typename K::Point_2 _isomin;
mutable typename K::Point_2 _isomax;
mutable typename K::FT _min, _max;
};
template <class K>
inline bool do_intersect(const typename K::Ray_2 &p1,
const typename K::Iso_rectangle_2 &p2,
const K&)
{
typedef Ray_2_Iso_rectangle_2_pair<K> pair_t;
pair_t pair(&p1, &p2);
return pair.intersection_type() != pair_t::NO_INTERSECTION;
}
template <class K>
inline bool do_intersect(const typename K::Iso_rectangle_2 &p2,
const typename K::Ray_2 &p1,
const K& k)
{
return do_intersect(p1, p2, k);
}
template <class K>
typename CGAL::Intersection_traits
<K, typename K::Ray_2, typename K::Iso_rectangle_2>::result_type
intersection(const typename K::Ray_2 &ray,
const typename K::Iso_rectangle_2 &iso,
const K& )
{
typedef Ray_2_Iso_rectangle_2_pair<K> is_t;
is_t ispair(&ray, &iso);
switch (ispair.intersection_type()) {
case is_t::NO_INTERSECTION:
default:
return intersection_return<typename K::Intersect_2, typename K::Ray_2, typename K::Iso_rectangle_2>();
case is_t::POINT:
return intersection_return<typename K::Intersect_2, typename K::Ray_2, typename K::Iso_rectangle_2>(ispair.intersection_point());
case is_t::SEGMENT:
return intersection_return<typename K::Intersect_2, typename K::Ray_2, typename K::Iso_rectangle_2>(ispair.intersection_segment());
}
}
template <class K>
typename CGAL::Intersection_traits
<K, typename K::Ray_2, typename K::Iso_rectangle_2>::result_type
intersection(const typename K::Iso_rectangle_2 &iso,
const typename K::Ray_2 &ray,
const K& k)
{
return intersection(ray, iso, k);
}
template <class K>
typename Ray_2_Iso_rectangle_2_pair<K>::Intersection_results
Ray_2_Iso_rectangle_2_pair<K>::intersection_type() const
{
typedef typename K::RT RT;
typedef typename K::FT FT;
if (_known)
return _result;
_known = true;
bool to_infinity = true;
typename K::Construct_cartesian_const_iterator_2 construct_cccit;
typename K::Cartesian_const_iterator_2 ref_point_it = construct_cccit(_ref_point);
typename K::Cartesian_const_iterator_2 end = construct_cccit(_ref_point, 0);
typename K::Cartesian_const_iterator_2 isomin_it = construct_cccit(_isomin);
typename K::Cartesian_const_iterator_2 isomax_it = construct_cccit(_isomax);
for (unsigned int i=0; ref_point_it != end; ++i, ++ref_point_it, ++isomin_it, ++isomax_it) {
if (_dir.homogeneous(i) == RT(0)) {
if ((*ref_point_it) < (*isomin_it)) {
_result = NO_INTERSECTION;
return _result;
}
if ((*ref_point_it) > (*isomax_it)) {
_result = NO_INTERSECTION;
return _result;
}
} else {
FT newmin, newmax;
if (_dir.homogeneous(i) > RT(0)) {
newmin = (*isomin_it - *ref_point_it) /
_dir.cartesian(i);
newmax = (*isomax_it - *ref_point_it) /
_dir.cartesian(i);
} else {
newmin = (*isomax_it - *ref_point_it) /
_dir.cartesian(i);
newmax = (*isomin_it - *ref_point_it) /
_dir.cartesian(i);
}
if (newmin > _min)
_min = newmin;
if (to_infinity) {
_max = newmax;
} else {
if (newmax < _max)
_max = newmax;
}
if (_max < _min) {
_result = NO_INTERSECTION;
return _result;
}
to_infinity = false;
}
}
CGAL_kernel_assertion(!to_infinity);
if (_max == _min) {
_result = POINT;
return _result;
}
_result = SEGMENT;
return _result;
}
template <class K>
typename K::Segment_2
Ray_2_Iso_rectangle_2_pair<K>::intersection_segment() const
{
typedef typename K::Segment_2 Segment_2;
typename K::Construct_translated_point_2 translated_point;
typename K::Construct_scaled_vector_2 construct_scaled_vector;
if (!_known)
intersection_type();
CGAL_kernel_assertion(_result == SEGMENT);
typename K::Point_2 p1(translated_point(_ref_point, construct_scaled_vector(_dir,_min)));
typename K::Point_2 p2(translated_point(_ref_point, construct_scaled_vector(_dir,_max)));
return Segment_2(p1, p2);
}
template <class K>
typename K::Point_2
Ray_2_Iso_rectangle_2_pair<K>::intersection_point() const
{
typedef typename K::Point_2 Point_2;
typename K::Construct_translated_point_2 translated_point;
typename K::Construct_scaled_vector_2 construct_scaled_vector;
if (!_known)
intersection_type();
CGAL_kernel_assertion(_result == POINT);
return Point_2(translated_point(_ref_point, construct_scaled_vector(_dir, _min)));
}
} // namespace internal
CGAL_INTERSECTION_FUNCTION(Ray_2, Iso_rectangle_2, 2)
CGAL_DO_INTERSECT_FUNCTION(Ray_2, Iso_rectangle_2, 2)
} //namespace CGAL
#endif // CGAL_RAY_2_iSO_RECTANGLE_2_INTERSECTION_H
|
