Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] performance of Delaunay Triangulation of random

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] performance of Delaunay Triangulation of random


Chronological Thread 
  • From: Ding <>
  • To:
  • Subject: Re: [cgal-discuss] performance of Delaunay Triangulation of random
  • Date: Sat, 20 Dec 2008 18:13:25 +0100 (CET)

Thanks a lot for the detailed explanation.

Optimization option "-O2 -DNDEBUG" sovles the problem. Now DT of 0.125M 3D
grid
points on takes 4.93 sec, and DT of 1M 3D grid points takes 40.11 sec.

Another question is that if the 3D points are all on a smooth surface, e.g.,
vertices on a surface mesh, is there any way to accelerate DT on such points?

regards,
df



Archive powered by MHonArc 2.6.16.

Top of Page