Min_circle_2/min_circle_homogeneous_2.cpp

#include <CGAL/Exact_integer.h>
#include <CGAL/Simple_homogeneous.h>
#include <CGAL/Min_circle_2.h>
#include <CGAL/Min_circle_2_traits_2.h>

#include <iostream>

// typedefs
typedef  CGAL::Exact_integer             RT;
typedef  CGAL::Simple_homogeneous<RT>    K;
typedef  CGAL::Min_circle_2_traits_2<K>  Traits;
typedef  CGAL::Min_circle_2<Traits>      Min_circle;
typedef  K::Point_2                      Point;

int
main( int, char**)
{
  const int n = 100;
  Point P[n];

  for ( int i = 0; i < n; ++i){
    P[i] = Point( (i%2 == 0 ? i : -i), 0, 1);
    // (0,0), (-1,0), (2,0), (-3,0), ...
  }

  Min_circle  mc1( P, P+n, false);    // very slow
  Min_circle  mc2( P, P+n, true);     // fast

  CGAL::set_pretty_mode( std::cout);
  std::cout << mc2;

  return 0;
}