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
|
// Copyright (c) 1997-2001 Freie Universitaet Berlin (Germany).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL 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.2-branch/Min_circle_2/include/CGAL/Optimisation_circle_2.h $
// $Id: Optimisation_circle_2.h 28567 2006-02-16 14:30:13Z lsaboret $
//
//
// Author(s) : Sven Schoenherr <sven@inf.ethz.ch>, Bernd Gaertner
#ifndef CGAL_OPTIMISATION_CIRCLE_2_H
#define CGAL_OPTIMISATION_CIRCLE_2_H
// includes
#ifndef CGAL_BASIC_CONSTRUCTIONS_2_H
# include <CGAL/basic_constructions_2.h>
#endif
#ifndef CGAL_SQUARED_DISTANCE_2_H
# include <CGAL/squared_distance_2.h>
#endif
CGAL_BEGIN_NAMESPACE
// Class declaration
// =================
template < class K_ >
class Optimisation_circle_2;
// Class interface
// ===============
template < class K_ >
class Optimisation_circle_2 {
public:
// types
typedef K_ K;
typedef typename K::Point_2 Point;
typedef typename K_::FT Distance;
/**************************************************************************
WORKAROUND: Some compilers are unable to match member functions defined
outside the class template. Therefore, all member functions are implemented
in the class interface.
// creation
Optimisation_circle_2( );
void set( );
void set( const Point& p);
void set( const Point& p, const Point& q);
void set( const Point& p, const Point& q, const Point& r);
void set( const Point& center, const Distance& squared_radius);
// access functions
const Point& center ( ) const;
const Distance& squared_radius( ) const
// equality tests
bool operator == ( const Optimisation_circle_2<K>& c) const;
bool operator != ( const Optimisation_circle_2<K>& c) const;
// predicates
CGAL::Bounded_side bounded_side( const Point& p) const;
bool has_on_bounded_side ( const Point& p) const;
bool has_on_boundary ( const Point& p) const;
bool has_on_unbounded_side ( const Point& p) const;
bool is_empty ( ) const;
bool is_degenerate( ) const;
**************************************************************************/
private:
// private data members
Point _center;
Distance _squared_radius;
// ============================================================================
// Class implementation
// ====================
public:
// Constructor
// -----------
inline
Optimisation_circle_2( )
{ }
// Set functions
// -------------
inline
void
set( )
{
_center = Point( CGAL::ORIGIN);
_squared_radius = -Distance( 1);
}
inline
void
set( const Point& p)
{
_center = p;
_squared_radius = Distance( 0);
}
inline
void
set( const Point& p, const Point& q)
{
_center = CGAL::midpoint( p, q);
_squared_radius = CGAL::squared_distance( p, _center);
}
inline
void
set( const Point& p, const Point& q, const Point& r)
{
_center = CGAL::circumcenter( p, q, r);
_squared_radius = CGAL::squared_distance( p, _center);
}
inline
void
set( const Point& center, const Distance& squared_radius)
{
_center = center;
_squared_radius = squared_radius;
}
// Access functions
// ----------------
inline
const Point&
center( ) const
{
return( _center);
}
inline
const Distance&
squared_radius( ) const
{
return( _squared_radius);
}
// Equality tests
// --------------
bool
operator == ( const Optimisation_circle_2<K>& c) const
{
return( ( _center == c._center ) &&
( _squared_radius == c._squared_radius) );
}
bool
operator != ( const Optimisation_circle_2<K>& c) const
{
return( ! operator==( c));
}
// Predicates
// ----------
inline
CGAL::Bounded_side
bounded_side( const Point& p) const
{
return( CGAL::Bounded_side( CGAL_NTS sign(
_squared_radius - CGAL::squared_distance( p, _center))));
}
inline
bool
has_on_bounded_side( const Point& p) const
{
return( CGAL::squared_distance( p, _center) < _squared_radius);
}
inline
bool
has_on_boundary( const Point& p) const
{
return( CGAL::squared_distance( p, _center) == _squared_radius);
}
inline
bool
has_on_unbounded_side( const Point& p) const
{
return( _squared_radius < CGAL::squared_distance( p, _center));
}
inline
bool
is_empty( ) const
{
return( CGAL::is_negative( _squared_radius));
}
inline
bool
is_degenerate( ) const
{
return( ! CGAL::is_positive( _squared_radius));
}
};
// Function declarations
// =====================
// I/O
// ---
template < class K_ >
std::ostream&
operator << ( std::ostream&, const CGAL::Optimisation_circle_2<K_>&);
template < class K_ >
std::istream&
operator >> ( std::istream&, CGAL::Optimisation_circle_2<K_>&);
CGAL_END_NAMESPACE
#ifdef CGAL_CFG_NO_AUTOMATIC_TEMPLATE_INCLUSION
# include <CGAL/Optimisation_circle_2.C>
#endif
#endif // CGAL_OPTIMISATION_CIRCLE_2_H
// ===== EOF ==================================================================
|
