Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Regular Triangulation precision question

Subject: CGAL users discussion list

List archive

[cgal-discuss] Regular Triangulation precision question


Chronological Thread 
  • From: Luis Fernando <>
  • To:
  • Subject: [cgal-discuss] Regular Triangulation precision question
  • Date: Wed, 27 May 2009 14:26:34 -0300
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:from:date:message-id:subject:to:content-type; b=YsHsOhd0zNAvM0ml0NM0a68VFNQWgRq1VKqEquw+uCtrZYCyPEwQt06cpXFKgroS7M +/pF5gOogi2aiV2QItBhSBXFUNjtSneMLj0Vn7SZBgGTFHX2zB1n5XoN1RRCOQsuabCS v9ah6fRQNgVjP5g+2qCJ/IbrsPdwt7G1Jy07A=

Hi, I am using CGAL 3.3.1 to calculate 3D Regular Triangulations(RT).
The question arises by the fact that the RT algorithm produces different results over the same input.
The RT solution is the same, the algorithm is fine.
But I have to iterate over some cells and vertices of the solution, and at every execution their order varies.
I don't think this is a problem with the iterator since I checked the RT using cout<<RT and it internally has changed.
Points insertion is made using the method RT.insert(Point p).
Maybe it depends on the kernel precision.
I am using an Exact_predicates_inexact_constructions_kernel and a Regular_triangulation_filtered_traits_3.
So, the question is:
How do I obtain a constant RT solution or how do I iterate over the same vertices and cells order if the RTs are different?

Thanks! Luís Maia.


  • [cgal-discuss] Regular Triangulation precision question, Luis Fernando, 05/27/2009

Archive powered by MHonArc 2.6.16.

Top of Page