#include <CGAL/Cartesian.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/Convex_hull_d.h>
#include <CGAL/Convex_hull_d_traits_3.h>
#include <CGAL/Convex_hull_d_to_polyhedron_3.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/algorithm.h>
#include <vector>
#include <cassert>
#ifdef CGAL_USE_GMP
#include <CGAL/Gmpq.h>
typedef CGAL::Gmpq RT;
#else
#include <CGAL/MP_Float.h>
typedef CGAL::Quotient<CGAL::MP_Float> RT;
#endif
typedef K::Point_3 Point_3;
int main ()
{
Convex_hull_3 CH(3);
CGAL::Random_points_in_sphere_3<Point_3, Creator> gen(100);
for (int i = 0; i < 250 ; i++, ++gen)
CH.insert(*gen);
assert(CH.is_valid());
Polyhedron_3 P;
CGAL::convex_hull_d_to_polyhedron_3(CH,P);
std::cout << "The convex hull has " << P.size_of_vertices()
<< " vertices" << std::endl;
return 0;
}