/usr/include/CGAL/intersections_d.h is in libcgal-dev 4.7-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 | // Copyright (c) 2000,2001
// 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) : Michael Seel
#ifndef CGAL_INTERSECTIONS_D_H
#define CGAL_INTERSECTIONS_D_H
#include <CGAL/basic.h>
#include <CGAL/Intersection_traits.h>
namespace CGAL {
namespace internal {
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Line_d, typename R::Line_d)>::type
intersection(const typename R::Line_d& l1, const typename R::Line_d& l2, const R&)
{
typedef typename R::Line_d_Line_d_pair ll_pair;
ll_pair LL(l1, l2);
switch (LL.intersection_type()) {
case ll_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Line_d>();
case ll_pair::POINT: {
typename R::Point_d pt;
LL.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Line_d>(pt);
}
case ll_pair::LINE:
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Line_d>(l1);
}
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Line_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Ray_d, typename R::Ray_d)>::type
intersection(const typename R::Ray_d& l1, const typename R::Ray_d& l2, const R&)
{
typedef typename R::Ray_d_Ray_d_pair ll_pair;
ll_pair LL(l1,l2);
switch (LL.intersection_type()) {
case ll_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Ray_d>();
case ll_pair::POINT: {
typename R::Point_d p;
LL.intersection(p);
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Ray_d>(p);
}
case ll_pair::RAY: {
typename R::Ray_d r;
LL.intersection(r);
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Ray_d>(r);
}
case ll_pair::SEGMENT: {
typename R::Segment_d s;
LL.intersection(s);
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Ray_d>(s);
}
}
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Ray_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Segment_d, typename R::Segment_d)>::type
intersection(const typename R::Segment_d& l1, const typename R::Segment_d& l2, const R&)
{
typedef typename R::Segment_d_Segment_d_pair ll_pair;
ll_pair LL(l1,l2);
switch (LL.intersection_type()) {
case ll_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Segment_d>();
case ll_pair::POINT: {
typename R::Point_d p;
LL.intersection(p);
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Segment_d>(p);
}
case ll_pair::SEGMENT: {
typename R::Segment_d s;
LL.intersection(s);
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Segment_d>(s);
}
}
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Segment_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Line_d, typename R::Ray_d)>::type
intersection(const typename R::Line_d& l, const typename R::Ray_d& r, const R&)
{
typedef typename R::Line_d_Ray_d_pair lr_pair;
lr_pair LR(l,r);
switch (LR.intersection_type()) {
case lr_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Ray_d>();
case lr_pair::POINT: {
typename R::Point_d pt;
LR.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Ray_d>(pt);
}
case lr_pair::RAY: {
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Ray_d>(r);
}
}
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Ray_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Ray_d, typename R::Line_d)>::type
intersection(const typename R::Ray_d& r, const typename R::Line_d& l, const R& k)
{ return intersection(l,r,k); }
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Ray_d, typename R::Segment_d)>::type
intersection(const typename R::Ray_d& r, const typename R::Segment_d& s, const R&)
{
typedef typename R::Ray_d_Segment_d_pair rs_pair;
rs_pair RS(r,s);
switch (RS.intersection_type()) {
case rs_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Segment_d>();
case rs_pair::POINT: {
typename R::Point_d pt;
RS.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Segment_d>(pt);
}
case rs_pair::SEGMENT: {
typename R::Segment_d st;
RS.intersection(st);
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Segment_d>(st);
}
}
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Segment_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Segment_d, typename R::Ray_d)>::type
intersection(const typename R::Segment_d& s, const typename R::Ray_d& r, const R& k)
{ return intersection(r,s, k); }
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Line_d, typename R::Segment_d)>::type
intersection(const typename R::Line_d& l, const typename R::Segment_d& s, const R&)
{
typedef typename R::Line_d_Segment_d_pair rs_pair;
rs_pair RS(l,s);
switch (RS.intersection_type()) {
case rs_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Segment_d>();
case rs_pair::POINT: {
typename R::Point_d pt;
RS.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Segment_d>(pt);
}
case rs_pair::SEGMENT: {
typename R::Segment_d st;
RS.intersection(st);
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Segment_d>(st);
}
}
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Segment_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Segment_d, typename R::Line_d)>::type
intersection(const typename R::Segment_d& s, const typename R::Line_d& l, const R& r)
{ return intersection(l,s,r); }
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Line_d, typename R::Hyperplane_d)>::type
intersection(const typename R::Line_d& l, const typename R::Hyperplane_d& h, const R&)
{
typedef typename R::Line_d_Hyperplane_d_pair lh_pair;
lh_pair LH(l,h);
switch (LH.intersection_type()) {
case lh_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Hyperplane_d>();
case lh_pair::POINT: {
typename R::Point_d pt;
LH.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Hyperplane_d>(pt);
}
case lh_pair::LINE:
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Hyperplane_d>(l);
}
return intersection_return<typename R::Intersect_d, typename R::Line_d, typename R::Hyperplane_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Hyperplane_d, typename R::Line_d)>::type
intersection(const typename R::Hyperplane_d& h, const typename R::Line_d& l, const R& r)
{ return intersection(l,h,r); }
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Ray_d, typename R::Hyperplane_d)>::type
intersection(const typename R::Ray_d& r, const typename R::Hyperplane_d& h, const R&)
{
typedef typename R::Ray_d_Hyperplane_d_pair rh_pair;
rh_pair RH(r,h);
switch (RH.intersection_type()) {
case rh_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Hyperplane_d>();
case rh_pair::POINT: {
typename R::Point_d pt;
RH.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Hyperplane_d>(pt);
}
case rh_pair::RAY:
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Hyperplane_d>(r);
}
return intersection_return<typename R::Intersect_d, typename R::Ray_d, typename R::Hyperplane_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Hyperplane_d, typename R::Ray_d)>::type
intersection(const typename R::Hyperplane_d& h, const typename R::Ray_d& r, const R& k)
{ return intersection(r,h,k); }
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Segment_d, typename R::Hyperplane_d)>::type
intersection(const typename R::Segment_d& s, const typename R::Hyperplane_d& h, const R&)
{
typedef typename R::Segment_d_Hyperplane_d_pair sh_pair;
sh_pair SH(s,h);
switch (SH.intersection_type()) {
case sh_pair::NO_INTERSECTION:
default:
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Hyperplane_d>();
case sh_pair::POINT: {
typename R::Point_d pt;
SH.intersection(pt);
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Hyperplane_d>(pt);
}
case sh_pair::SEGMENT:
return intersection_return<typename R::Intersect_d, typename R::Segment_d, typename R::Hyperplane_d>(s);
}
return intersection_return<typename R::Intersect_d, typename R::Segment_d,
typename R::Hyperplane_d>(); // never reached
}
template <class R>
typename cpp11::result_of<typename R::Intersect_d(typename R::Hyperplane_d, typename R::Segment_d)>::type
intersection(const typename R::Hyperplane_d& h, const typename R::Segment_d& s, const R& r)
{ return intersection(s,h,r); }
template <class R>
inline bool do_intersect(const typename R::Line_d &l1, const typename R::Line_d &l2, const R&)
{ typedef typename R::Line_d_Line_d_pair ll_pair;
ll_pair LL(l1,l2);
return LL.intersection_type() != ll_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Ray_d &l1, const typename R::Ray_d &l2, const R&)
{ typedef typename R::Ray_d_Ray_d_pair ll_pair;
ll_pair LL(l1,l2);
return LL.intersection_type() != ll_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Segment_d &l1, const typename R::Segment_d &l2, const R&)
{ typedef typename R::Segment_d_Segment_d_pair ll_pair;
ll_pair LL(l1,l2);
return LL.intersection_type() != ll_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Line_d& l, const typename R::Ray_d& r, const R&)
{ typedef typename R::Line_d_Ray_d_pair lr_pair;
lr_pair LR(l,r);
return LR.intersection_type() != lr_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Ray_d& r, const typename R::Line_d& l, const R& k)
{ return do_intersect(l,r, k); }
template <class R>
inline bool do_intersect(const typename R::Line_d& l, const typename R::Segment_d& s, const R&)
{ typedef typename R::Line_d_Segment_d_pair ls_pair;
ls_pair LS(l,s);
return LS.intersection_type() != ls_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Segment_d& s, const typename R::Line_d& l, const R& r)
{ return do_intersect(l,s, r); }
template <class R>
inline bool do_intersect(const typename R::Ray_d& r, const typename R::Segment_d& s, const R&)
{ typedef typename R::Ray_d_Segment_d_pair rs_pair;
rs_pair RS(r,s);
return RS.intersection_type() != rs_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Segment_d& s, const typename R::Ray_d& r, const R& k)
{ return do_intersect(r,s,k); }
template <class R>
inline bool do_intersect(const typename R::Line_d& l, const typename R::Hyperplane_d& h, const R&)
{ typedef typename R::Line_d_Hyperplane_d_pair lh_pair;
lh_pair LH(l,h);
return LH.intersection_type() != lh_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Hyperplane_d& h, const typename R::Line_d& l, const R&)
{ return do_intersect(l,h); }
template <class R>
inline bool do_intersect(const typename R::Ray_d& r, const typename R::Hyperplane_d& h, const R&)
{ typedef typename R::Ray_d_Hyperplane_d_pair rh_pair;
rh_pair RH(r,h);
return RH.intersection_type() != rh_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Hyperplane_d& h, const typename R::Ray_d& r, const R& k)
{ return do_intersect(r,h,k); }
template <class R>
inline bool do_intersect(const typename R::Segment_d& s, const typename R::Hyperplane_d& h, const R&)
{ typedef typename R::Segment_d_Hyperplane_d_pair sh_pair;
sh_pair SH(s,h);
return SH.intersection_type() != sh_pair::NO_INTERSECTION;
}
template <class R>
inline bool do_intersect(const typename R::Hyperplane_d& h, const typename R::Segment_d& s, const R& r)
{ return do_intersect(s,h,r); }
} //namespace internal
template<typename T>
class Hyperplane_d;
template<typename T>
class Line_d;
template<typename T>
class Segment_d;
template<typename T>
class Ray_d;
// global intersection
CGAL_INTERSECTION_FUNCTION_SELF(Line_d, d)
CGAL_INTERSECTION_FUNCTION_SELF(Ray_d, d)
CGAL_INTERSECTION_FUNCTION_SELF(Segment_d, d)
CGAL_INTERSECTION_FUNCTION(Line_d, Ray_d, d)
CGAL_INTERSECTION_FUNCTION(Ray_d, Segment_d, d)
CGAL_INTERSECTION_FUNCTION(Line_d, Segment_d, d)
CGAL_INTERSECTION_FUNCTION(Line_d, Hyperplane_d, d)
CGAL_INTERSECTION_FUNCTION(Ray_d, Hyperplane_d, d)
CGAL_INTERSECTION_FUNCTION(Segment_d, Hyperplane_d, d)
// global do_intersect
CGAL_DO_INTERSECT_FUNCTION_SELF(Line_d, d)
CGAL_DO_INTERSECT_FUNCTION_SELF(Ray_d, d)
CGAL_DO_INTERSECT_FUNCTION_SELF(Segment_d, d)
CGAL_DO_INTERSECT_FUNCTION(Line_d, Ray_d, d)
CGAL_DO_INTERSECT_FUNCTION(Line_d, Segment_d, d)
CGAL_DO_INTERSECT_FUNCTION(Ray_d, Segment_d, d)
CGAL_DO_INTERSECT_FUNCTION(Line_d, Hyperplane_d, d)
CGAL_DO_INTERSECT_FUNCTION(Ray_d, Hyperplane_d, d)
CGAL_DO_INTERSECT_FUNCTION(Segment_d, Hyperplane_d, d)
} //namespace CGAL
#endif //CGAL_INTERSECTIONS_D_H
|