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
|
// Copyright (c) 2003-2008 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
// 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/Circular_kernel_2/include/CGAL/global_functions_circular_kernel_2.h $
// $Id: global_functions_circular_kernel_2.h 67117 2012-01-13 18:14:48Z lrineau $
//
// Author(s) : Monique Teillaud, Sylvain Pion, Julien Hazebrouck, Pedro Machado
// Partially supported by the IST Programme of the EU as a Shared-cost
// RTD (FET Open) Project under Contract No IST-2000-26473
// (ECG - Effective Computational Geometry for Curves and Surfaces)
// and a STREP (FET Open) Project under Contract No IST-006413
// (ACS -- Algorithms for Complex Shapes)
#ifndef CGAL_CIRCULAR_KERNEL_GLOBAL_FUNCTIONS_CIRCULAR_KERNEL_2_H
#define CGAL_CIRCULAR_KERNEL_GLOBAL_FUNCTIONS_CIRCULAR_KERNEL_2_H
// global functions
#include <CGAL/Circular_arc_2.h>
#include <CGAL/Circular_arc_point_2.h>
#include <CGAL/Line_arc_2.h>
#include <CGAL/Circular_kernel_2/internal_functions_on_circle_2.h>
namespace CGAL {
template <class CK>
Circular_arc_point_2<CK>
x_extremal_point(const Circle_2<CK> & c, bool i)
{
return CircularFunctors::x_extremal_point<CK>(c,i);
}
template <class CK, class OutputIterator>
OutputIterator
x_extremal_points(const Circle_2<CK> & c, OutputIterator res)
{
return CircularFunctors::x_extremal_points<CK>(c,res);
}
template <class CK>
Circular_arc_point_2<CK>
y_extremal_point(const Circle_2<CK> & c, bool i)
{
return CircularFunctors::y_extremal_point<CK>(c,i);
}
template <class CK, class OutputIterator>
OutputIterator
y_extremal_points(const Circle_2<CK> & c, OutputIterator res)
{
return CircularFunctors::y_extremal_points<CK>(c,res);
}
// Not Documented
template< class CK >
inline
CGAL::Comparison_result
compare_x(const Circular_arc_2<CK> &A1, const bool b1,
const Circular_arc_2<CK> &A2, const bool b2)
{
return CK().compare_x_2_object()(A1, b1, A2, b2);
}
template< class CK >
inline
CGAL::Comparison_result
compare_x(const Circular_arc_point_2<CK> &p, const Circular_arc_point_2<CK> &q)
{
return CK().compare_x_2_object()(p, q);
}
template< class CK >
inline
CGAL::Comparison_result
compare_y(const Circular_arc_point_2<CK> &p, const Circular_arc_point_2<CK> &q)
{
return CK().compare_y_2_object()(p, q);
}
template< class CK >
inline
CGAL::Comparison_result
compare_xy(const Circular_arc_point_2<CK> &p, const Circular_arc_point_2<CK> &q)
{
return CK().compare_xy_2_object()(p, q);
}
template< class CK >
inline
CGAL::Comparison_result
compare_y_to_right(const Circular_arc_2<CK> &A1,
const Circular_arc_2<CK> &A2,
const Circular_arc_point_2<CK> &p)
{
return CK().compare_y_to_right_2_object()(A1, A2, p);
}
template < class CK >
inline
bool
has_in_x_range(const Circular_arc_2<CK> &A, const Circular_arc_point_2<CK> &p)
{
return CK().in_x_range_2_object()(A, p);
}
template < class CK >
CGAL::Comparison_result
compare_y_at_x(const Circular_arc_point_2<CK> &p, const Circular_arc_2<CK> &a)
{
return CK().compare_y_at_x_2_object()(p, a);
}
template < class CK, class OutputIterator >
OutputIterator
make_x_monotone(const Circular_arc_2<CK> &A, OutputIterator it)
{
return CK().make_x_monotone_2_object()(A, it);
}
template < class CK, class OutputIterator >
OutputIterator
make_xy_monotone(const Circular_arc_2<CK> &A, OutputIterator it)
{
return CK().make_xy_monotone_2_object()(A, it);
}
template< class CK >
inline
bool
has_on(const Circle_2<CK> &c, const Circular_arc_point_2<CK> &p)
{
return CK().has_on_2_object()(c, p);
}
// Not Documented
template< class CK >
inline
CGAL::Comparison_result
compare_y_to_right(const Line_arc_2<CK> &A1,
const Line_arc_2<CK> &A2,
const Circular_arc_point_2<CK> &p)
{
return CK().compare_y_to_right_2_object()(A1, A2, p);
}
template < class CK >
inline
bool
has_in_x_range(const Line_arc_2<CK> &A, const Circular_arc_point_2<CK> &p)
{
return CK().in_x_range_2_object()(A, p);
}
template < class CK >
CGAL::Comparison_result
compare_y_at_x(const Circular_arc_point_2<CK> &p, const Line_arc_2<CK> &a)
{
return CK().compare_y_at_x_2_object()(p, a);
}
// Not Documented
template < class CK, class OutputIterator >
OutputIterator
make_x_monotone(const Line_arc_2<CK> &A, OutputIterator it)
{
return CK().make_x_monotone_2_object()(A, it);
}
template < class CK, class OutputIterator >
OutputIterator
make_xy_monotone(const Line_arc_2<CK> &A, OutputIterator it)
{
return CK().make_xy_monotone_2_object()(A, it);
}
} //namespace CGAL
#endif // CGAL_CIRCULAR_KERNEL_GLOBAL_FUNCTIONS_CIRCULAR_KERNEL_2_H
|
