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: Sylvain Pion <>
  • To:
  • Subject: Re: [cgal-discuss] performance of Delaunay Triangulation of random
  • Date: Sat, 20 Dec 2008 17:39:38 +0100
  • Organization: INRIA

Hi,

Ding wrote:
There are some statements saying that CGAL can perform 3D DT of 1M random
points under 20 sec (13 or 16 sec). However, I tried the example provided in
the CGAL manual, 3D DT of only 0.125M points took 52.59 sec on a 2.13 GHz Core
2 Duo computer with 2G memory (Mac OSX 10.5). So I'm just wondering if any
options need to be set for better performance. Thank you!

You are not using random points.
Points on a grid may exhibit worse performance than random distributions.

Moreover, you do not mention the compiler optimization you use.
Best is something like -O2 -DNDEBUG.

--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/

Attachment: smime.p7s
Description: S/MIME Cryptographic Signature




Archive powered by MHonArc 2.6.16.

Top of Page