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: Daniel Duque <>
  • To:
  • Cc: Olivier Devillers <>
  • Subject: Re: [cgal-discuss] Computing Time Triangulation_3 vs Delaunay_triangulation_3
  • Date: Fri, 25 Nov 2011 12:35:59 +0100
  • Organization: UPM

If I recall correctly, these are points from medical imaging. In this case my
guess is that adding small random perturbations to all points would remove
degeneracies with a negligible impact on results.

D



On Thursday 24 November 2011 09:59:14 Olivier Devillers wrote:
> 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

--
http://dcain.etsin.upm.es/~daniel



Archive powered by MHonArc 2.6.16.

Top of Page