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
|
// computes the smallest enclosing annulus of two point
// sets on nested squares in R^2, using double
// as input type and some internal EXACT floating point type;
// the fast type double is also safely used for many of the
// internal computations
#include <CGAL/Min_annulus_d.h>
#include <CGAL/Min_sphere_annulus_d_traits_2.h>
#include <CGAL/Homogeneous.h>
#include <CGAL/Exact_integer.h>
typedef CGAL::Exact_integer ET;
#include <iostream>
#include <cassert>
#include <array>
// use an inexact kernel...
typedef CGAL::Homogeneous<double> K;
typedef K::Point_2 Point;
// ... and the EXACT traits class based on the inexcat kernel
typedef CGAL::Min_sphere_annulus_d_traits_2<K, ET, double> Traits;
typedef CGAL::Min_annulus_d<Traits> Min_annulus;
int main()
{
// points on the squares [-1,1]^2 and [-2,2]^2
std::array<Point, 8> P = { Point(-1,-1), Point(-1,1), Point(1,-1), Point(1,1),
Point(-2,-2), Point(-2,2), Point(2,-2), Point(2,2)};
Min_annulus ma(P.begin(), P.end());
assert (ma.is_valid());
// get center of annulus
Min_annulus::Coordinate_iterator coord_it;
std::cout << "center:"; // homogeneous point, (0,0,1)
for (coord_it = ma.center_coordinates_begin();
coord_it != ma.center_coordinates_end();
++coord_it)
std::cout << " " << CGAL::to_double(*coord_it);
std::cout << std::endl;
// get inner squared radius, 1^2+1^2 = 2
std::cout << "Inner squared radius: " <<
CGAL::to_double(ma.squared_inner_radius_numerator()) /
CGAL::to_double(ma.squared_radii_denominator()) << std::endl;
// get outer squared radius, 2^2+2^2 = 8
std::cout << "Outer squared radius: " <<
CGAL::to_double(ma.squared_outer_radius_numerator()) /
CGAL::to_double(ma.squared_radii_denominator()) << std::endl;
return 0;
}
|
