CGAL users discussion list

[Monique Teillaud <>]

Kwok Jasper wrote:
> Excuse me.
>
> I have tried to use the 3D Delaunay Triangulation in CGAL in Visual C++ 
> with the following declaration.
>
> typedef CGAL::Exact_predicates_inexact_constructions_kernel K1; 
> typedef CGAL::Delaunay_triangulation_3<K1> Triangulation;

Also, use t.insert(begin(),end()). It uses spatial sorting, which makes 
the construction much faster. See the manual.

> After I have set the compiler optimization in Visual C++, 
> when I insert 362272 points into the triangulation, it takes more than 
> 20 minutes
> and after the insertion, when I use the iterator such as the 
> Finite_facets_iterator, it also takes a lot of time.< br>

> May I ask if the running time is normal?

no, it is not normal

> Or in fact it should be faster in the normal case?

It should be much faster (a few seconds, depending on your computer)
Be careful to compile your code with the appropriate options (optimized 
and without debugging options).

> Thank you very much for your attention
>
> ------------------------------------------------------------------------
> ?? Windows Live™ Photos ??????? ????????? 
> <http://www.microsoft.com/windows/windowslive/events.aspx>