Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges


Chronological Thread 
  • From: Andreas Fabri <>
  • To:
  • Subject: Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges
  • Date: Mon, 03 Nov 2008 12:08:15 +0100

Dennis Endt wrote:
Monique Teillaud schrieb:
If you are lucky (= your points really don't belong to a plane
parallel to any xy,xz,yz plane), you will get the same triangulation
three times, which is not what you want (I guess so). Yhen using one
of these random traits should give you what you want.
If you are less lucky, one of the computationa will crash. Then, use
one of the other two.
I'm afraid that's the best you can do if you don't know anything about
your data, except the fact that they are almost coplanar.

best,
Monique Teillaud

Hi,

thanks so far for your help.

My last question is:
How can I check if a computational will crash? What is the best method
for this?


You should

#include <CGAL/Cristall_ball.h>

It provides a constructor with an unsigned int specifying the number
of milliseconds you want to look into the future.

It's an undocumented feature, but that is what we recommend for
avoiding planes to fall from the sky.




I tried to use is_valid(), but this didn`t worked. Is it enough to check
for the number_of_vertices != 0 of a fassade?

Best,
Dennis





Archive powered by MHonArc 2.6.16.

Top of Page