Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Using finger search with Delaunay Triangulation

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Using finger search with Delaunay Triangulation


Chronological Thread 
  • From: Sylvain Pion <>
  • To:
  • Subject: Re: [cgal-discuss] Using finger search with Delaunay Triangulation
  • Date: Sun, 19 Apr 2009 14:10:12 +0200

Hi Damian,

Damian Sheehy a écrit :
For a random set of points the Delaunay hierarchy should build a triangulation in much less time than the conventional Delaunay without a hierarchy. The numbers do not reflect that, so something is wrong. I will run your example tomorrow and see what I get. . .

This is not true anymore in recent CGAL releases, more precisely
since the introduction of a spatial sorting preprocessing phase (BRIO).

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



Archive powered by MHonArc 2.6.16.

Top of Page