Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Computing Time Triangulation_3 vs Delaunay_triangulation_3

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Computing Time Triangulation_3 vs Delaunay_triangulation_3


Chronological Thread 
  • From: Olivier Devillers <>
  • To:
  • Subject: Re: [cgal-discuss] Computing Time Triangulation_3 vs Delaunay_triangulation_3
  • Date: Thu, 24 Nov 2011 10:59:14 +0200

Le 11/24/11 10:29 AM, Juan Carlos Lopez Alfonso a écrit :
Hello Andreas,

Thank you for your answers.
Andreas Fabri this is the link with my set of points: http://dl.dropbox.com/u/2516160/ALLtreatmentPoints.txt

could you compress it ?


it seems that your points are non only in parallel planes but are actually taken
from a grid.

In such a case you will have many cospherical (and even cocircular) points
which create a lot of calls to the exact arithmetic.

Notice that computing the Delaunay triangulation of a (full) grid is quite easy
and should not be done using a standard Delaunay algorithm.
Thus if your data set contains pieces of grid, and you know it,
you may triangulate these parts "by hand"

Olivier






Archive powered by MHonArc 2.6.16.

Top of Page