CGAL users discussion list

[Juan Carlos Lopez Alfonso <>]

Hi all:

The documentation of Triangulation_3 says that constructions of Delaunay triangulations with more than 10^7 points is compute in 87.4 seconds. In my case, I have a set of points (3 500 000) in parallel planes and the computing time is much greater than this (hours). On the other hand, the same code in the same computer for a Triangulation_3 work very fast (minutes), but for Delaunay_triangulation_3 is very slow and throw an alloc exception (problem with memory).

Please, could anyone explain me the reasons of this problems?

Best regards and thank in advance

Juan Carlos