#include <CGAL/Cartesian_d.h>
#include <CGAL/Random.h>
#include <CGAL/Exact_rational.h>
#include <CGAL/Min_sphere_of_spheres_d.h>
#include <vector>
#include <cassert>
const int N = 1000;
const int D = 3;
const int LOW = 0, HIGH = 10000;
typedef CGAL::Exact_rational FT;
typedef CGAL::Cartesian_d<FT> K;
typedef K::Point_d Point;
typedef Traits::Sphere Sphere;
int main () {
std::vector<Sphere> S;
FT coord[D];
CGAL::Random r;
for (int i=0; i<N; ++i) {
for (int j=0; j<D; ++j)
coord[j] = r.get_int(LOW,HIGH);
Point p(D,coord,coord+D);
S.push_back(Sphere(p,r.get_int(LOW,HIGH)));
}
Min_sphere ms(S.begin(),S.end());
assert(ms.is_valid());
}
The class Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphe...
Definition: Min_sphere_of_spheres_d_traits_d.h:34
An object of the class Min_sphere_of_spheres_d is a data structure that represents the unique sphere ...
Definition: Min_sphere_of_spheres_d.h:102