Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp

// Computes the minsphere of some random spheres.
 
#include <CGAL/Cartesian.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;                       // number of spheres
const int LOW = 0, HIGH = 10000;          // range of coordinates and radii
 
typedef CGAL::Exact_rational              FT;
//typedef double                          FT;
typedef CGAL::Cartesian<FT>               K;
typedef CGAL::Min_sphere_of_spheres_d_traits_2<K,FT> Traits;
typedef CGAL::Min_sphere_of_spheres_d<Traits> Min_sphere;
typedef K::Point_2                        Point;
typedef Traits::Sphere                    Sphere;
 
int main () {
  std::vector<Sphere> S;                  // n spheres
  CGAL::Random r;                         // random number generator
 
  for (int i=0; i<N; ++i) {
    const FT x = r.get_int(LOW,HIGH),
             y = r.get_int(LOW,HIGH);
    Point p(x,y);                         // random center...
    S.push_back(Sphere(p,r.get_int(LOW,HIGH))); // ...and random radius
  }
 
  Min_sphere ms(S.begin(),S.end());       // check in the spheres
  assert(ms.is_valid());
}