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
|
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Intersections_2/include/CGAL/Point_2_Ray_2_intersection.h $
// $Id: Point_2_Ray_2_intersection.h 67093 2012-01-13 11:22:39Z lrineau $
//
//
// Author(s) : Geert-Jan Giezeman
#ifndef CGAL_POINT_2_RAY_2_INTERSECTION_H
#define CGAL_POINT_2_RAY_2_INTERSECTION_H
#include <CGAL/Ray_2.h>
#include <CGAL/Point_2.h>
#include <CGAL/Object.h>
namespace CGAL {
namespace internal {
template <class K>
inline
bool
do_intersect(const typename K::Point_2 &pt,
const typename K::Ray_2 &ray,
const K&)
{
return ray.has_on(pt);
}
template <class K>
inline
bool
do_intersect(const typename K::Ray_2 &ray,
const typename K::Point_2 &pt,
const K&)
{
return ray.has_on(pt);
}
template <class K>
Object
intersection(const typename K::Point_2 &pt,
const typename K::Ray_2 &ray,
const K& k)
{
if (do_intersect(pt,ray, k)) {
return make_object(pt);
}
return Object();
}
template <class K>
Object
intersection(const typename K::Ray_2 &ray,
const typename K::Point_2 &pt,
const K& k)
{
if (do_intersect(pt,ray, k)) {
return make_object(pt);
}
return Object();
}
} // namespace internal
template <class K>
inline
bool
do_intersect(const Ray_2<K> &ray, const Point_2<K> &pt)
{
typedef typename K::Do_intersect_2 Do_intersect;
return Do_intersect()(pt, ray);
}
template <class K>
inline
bool
do_intersect(const Point_2<K> &pt, const Ray_2<K> &ray)
{
typedef typename K::Do_intersect_2 Do_intersect;
return Do_intersect()(pt, ray);
}
template <class K>
inline Object
intersection(const Ray_2<K> &ray, const Point_2<K> &pt)
{
typedef typename K::Intersect_2 Intersect;
return Intersect()(pt, ray);
}
template <class K>
inline Object
intersection(const Point_2<K> &pt, const Ray_2<K> &ray)
{
typedef typename K::Intersect_2 Intersect;
return Intersect()(pt, ray);
}
} //namespace CGAL
#endif
|
