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
|
// Copyright (c) 2003 INRIA Sophia-Antipolis (France).
// 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.6-branch/Intersections_3/include/CGAL/Triangle_3_Line_3_do_intersect.h $
// $Id: Triangle_3_Line_3_do_intersect.h 53116 2009-11-20 12:36:02Z stayeb $
//
//
// Author(s) : Philippe Guigue
#ifndef CGAL_TRIANGLE_3_LINE_3_DO_INTERSECT_H
#define CGAL_TRIANGLE_3_LINE_3_DO_INTERSECT_H
CGAL_BEGIN_NAMESPACE
namespace internal {
template <class K>
bool do_intersect(const typename K::Triangle_3 &t,
const typename K::Line_3 &l,
const K & k )
{
CGAL_kernel_precondition( ! k.is_degenerate_3_object()(t) ) ;
CGAL_kernel_precondition( ! k.is_degenerate_3_object()(l) ) ;
typedef typename K::Point_3 Point_3;
typename K::Construct_point_on_3 point_on =
k.construct_point_on_3_object();
typename K::Construct_vertex_3 vertex_on =
k.construct_vertex_3_object();
typename K::Orientation_3 orientation =
k.orientation_3_object();
typename K::Coplanar_orientation_3 coplanar_orientation =
k.coplanar_orientation_3_object();
const Point_3 & a = vertex_on(t,0);
const Point_3 & b = vertex_on(t,1);
const Point_3 & c = vertex_on(t,2);
const Point_3 & p = point_on(l,0);
const Point_3 & q = point_on(l,1);
if ( ( orientation(a,b,c,p) != COPLANAR ) ||
( orientation(a,b,c,q) != COPLANAR ) )
{
const Orientation pqab = orientation(p,q,a,b);
const Orientation pqbc = orientation(p,q,b,c);
switch ( pqab ) {
case POSITIVE: return pqbc != NEGATIVE &&
orientation(p,q,c,a) != NEGATIVE ;
case NEGATIVE: return pqbc != POSITIVE &&
orientation(p,q,c,a) != POSITIVE ;
case COPLANAR:
switch ( pqbc ) {
case POSITIVE: return orientation(p,q,c,a) != NEGATIVE ;
case NEGATIVE: return orientation(p,q,c,a) != POSITIVE ;
case COPLANAR: return true;
default: // should not happen.
CGAL_kernel_assertion(false);
return false;
}
default: // should not happen.
CGAL_kernel_assertion(false);
return false;
}
}
// Coplanar case
const Orientation pqa = coplanar_orientation(p,q,a);
return coplanar_orientation(p,q,b) != pqa
|| coplanar_orientation(p,q,c) != pqa ;
}
template <class K>
inline
bool do_intersect(const typename K::Line_3 &l,
const typename K::Triangle_3 &t,
const K & k )
{
return do_intersect(t, l, k);
}
} // namespace internal
template <class K>
bool do_intersect(const Triangle_3<K> &t,
const Line_3<K> &l)
{
return typename K::Do_intersect_3()(t,l);
}
template <class K>
inline bool do_intersect(const Line_3<K> &l,
const Triangle_3<K> &t)
{
return typename K::Do_intersect_3()(t,l);
}
/*
template <class K>
inline bool do_intersect(const Line_3<K> &l,
const Triangle_3<K> &t,
const K & k )
{
return do_intersect(t,l,k);
}
*/
CGAL_END_NAMESPACE
#endif //CGAL_TRIANGLE_3_LINE_3_DO_INTERSECT_H
|
