Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking


Chronological Thread 
  • From: Camille Wormser <>
  • To:
  • Subject: Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking
  • Date: Thu, 22 Nov 2007 18:00:46 +0100

Ashwin Nanjappa wrote:
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.

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.

You should expect this slowdown, because the hierarchy is a data structure on top of your triangulation, which needs some time to be built.

On the other hand, if you plan on inserting points one by one later on in your process, you should definitely use the hierarchy: it will speed up location requests which are needed for the insertions.
--
Camille Wormser



Archive powered by MHonArc 2.6.16.

Top of Page