#include <vector>
#include <CGAL/Cartesian_d.h>
#include <CGAL/Random.h>
#include <CGAL/Timer.h>
#include "solve_convex_hull_containment_lp3.h"
#ifdef CGAL_USE_GMP
#else
#endif
typedef CGAL::Cartesian_d<double> Kernel_d;
typedef Kernel_d::Point_d Point_d;
int main()
{
  const int d = 10;       
  const int n = 100000;   
  
  CGAL::Random rd;
  std::vector<Point_d> points;
  for (int j =0; j<n; ++j) {
    std::vector<double> coords;
    for (int i=0; i<d; ++i) 
      coords.push_back(rd.get_double());
    points.push_back (Point_d (d, coords.begin(), coords.end()));
  }
  
  
  };
  
  CGAL::Timer t;
  for (int i=0; i<6; ++i) {
    
    t.reset(); t.start();
    
    solve_convex_hull_containment_lp 
       ET(0), options);
    t.stop();
    std::cout << "Time (s) = " << t.time() << std::endl;
  }
  return 0;
}