CGAL users discussion list

[Bernd Gaertner <>]

It also depends on what you want to do with the convex hull. Do you 
really need the hull explicitly, or do you for example just need to test 
whether some other point is inside the hull? The latter task can be done 
much faster, by using CGAL's QP_solver; get back to me for details if 
this is what you need.

Best,
Bernd.


 wrote:
> Dear all,
>
> I am using CGAL::Convex_hull_d to compute the convex hull of a small set of
> points in some n-dimensional space. Here, small means 2*n points, where n is
> the number of dimensions of the space (3 <= n <= 6). Unfortunately, compute 
> the
> convex hull is the bottleneck of my implementation. Actually, the program
> spends 87% of the time calling CGAL::Convex_hull_d.insert().
>
> Today, my implementation takes several minutes to process simple data sets and
> I want to make it run faster. My question is: There is some trick that I can
> use to improve CGAL’s performance assuming a small number of input points? I
> believe that the bottleneck inside CGAL is memory allocation.-- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss