CGAL users discussion list

[Camille Wormser <>]

> I believe that the bottleneck inside CGAL is memory allocation.--

In fact, the bottleneck is due to Convex_hull_d storing constructed  
hyperplanes (also inside the convex hull, for locating points easily),  
which means

1) that an exact number type is needed for robustness

2) that the size of the datastructure explodes because of storing all  
these coefficients (one hyperplane, hence d+1 coefficients, per  
simplex, and an exploding number of simplices in the dimension) in an  
exact number type, whose size explodes too.

So it is not really memory allocation, but memory size, which is the  
problem.

There is currently work being done on algorithms in higher dimensions.  
So you may see improvements in this area in the not too distant  
future...
--
Camille