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: Dennis Endt <>
  • To:
  • Subject: Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges
  • Date: Sun, 02 Nov 2008 22:51:30 +0100
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=googlemail.com; s=gamma; h=message-id:date:from:user-agent:mime-version:to:subject:references :in-reply-to:content-type:content-transfer-encoding; b=OSdlvke+SGITuDbocqh/saYmJUTrMdW6NUvJk2mq+lhaiYwrCflmCxSlicS+OKvsMB oiDFn39soXgcGQDV1YLy5SQdeD4V7NElQHO8zzl7wS1jsG7148jIcfj7mSibh0fXajvF LO+5vzpxwcq7h8I9+f2qX/SAhrv+RuLozVLqY=

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.
>
>
Hi Monique,

how can avoid a crash? Is it enough to check for "is_valid()"?

I read the manual and solved the problem with the edges and the points.

But I don`t understand how I get the 3 Points of a face with the help
of the following loop?

for(Delaunay::Finite_faces_iterator it = T.finite_faces_begin(); it !=
T.finite_faces_end(); it++)
{
}

I thought about:
(*it).vertex(1)->point()
(*it).vertex(2)->point()
(*it).vertex(3)->point()

Is that right?

Best,
Dennis



Archive powered by MHonArc 2.6.16.

Top of Page