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: Mon, 03 Nov 2008 12:04:26 +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=FyaemnqZCiTgF3U+Oz9nPDOkwZjDMuWdFdyVWl/Gy4zaqAJqp9PDnR6SU4tquWrvJJ nEVWTwlvniIOl1nXJe4hMWcYKKQRj00o1gtZu7RyvCbnwKde5KSODhhde8bmYdtCHzuO tpKZuKBnvZWM5GAFPkreogYY8/ufweNiIiy+A=

Dennis Endt schrieb:
> 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?
>
> 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
>
>
Sorry,

I mean number_of_faces() instead of number_of_vertices().



Archive powered by MHonArc 2.6.16.

Top of Page