CGAL users discussion list

[Sylvain Pion <>]

Matthew Denno wrote:
> I seem to remember seeing a table somewhere that showed some performance 
> benchmarks for different numbers of points using different kernels.  I 
> think it might have been for time to add points to a delaunay 
> triangulation.  Does anyone know where I can find this?  I have tried 
> Googleing and looking thought the project website with no luck.

There are some papers showing some benchmarks about CGAL's 3D Delaunay,
for example :

@inproceedings{ cgal:dp-eegpd-03
 , author =    "Olivier Devillers and Sylvain Pion"
 , title =     "Efficient Exact Geometric Predicates for {Delaunay} 
Triangulations"
 , booktitle = "Proc. 5th Workshop Algorithm Eng. Exper."
 , nickname =  "ALENEX '03"
 , year =      2003
 , pages =     "37--44"
}

There is also this comparison benchmark paper :
"A Comparison of Five Implementations of 3D. Delaunay Tessellation."
by YUANXIN LIU AND JACK SNOEYINK
http://www.msri.org/communications/books/Book52/files/23liu.pdf


There is currently nothing in the CGAL manual, but I just wrote
something that will end up there in the next release (3.6).
See the attached PDF (there, "Fast location" means the
Triangulation_hierarchy_3 mechanism).

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

Attachment: T3_benchmarks.pdf
Description: Adobe PDF document