Subject: CGAL users discussion list
List archive
- From: Ashwin Nanjappa <>
- To:
- Subject: Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking
- Date: Thu, 22 Nov 2007 19:29:11 +0800
wrote:
Hello,
You may want to check a triangulation with hierarchy:
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_hierarchy_3.html#Index_anchor_1260
I am not sure if it will make a huge difference for the creation of the
triangulation, but it should be interesting to try.
Thanks Daniel, I didn't know about Triangulation_hierarchy_3. I guess I need to read through Devillers' paper on _The Delaunay Hierarchy_ [1] to understand how it works! :-)
Using the Triangulation_3/hierarchy.cpp example code, I tried both Delaunay_triangulation_3 and Triangulation_hierarchy_3. I found that everything else being equal, T_hierarchy_3 is a bit slower. Not by much, but definitely slower.
[1] <http://dx.doi.org/10.1142/S0129054102001035>
Regards,
~ash
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, daniel . duque, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Ashwin Nanjappa, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Camille Wormser, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Ashwin Nanjappa, 11/22/2007
Archive powered by MHonArc 2.6.16.