Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Re: looking for method to convert 2D triangulation into Delaunay

Subject: CGAL users discussion list

List archive

[cgal-discuss] Re: looking for method to convert 2D triangulation into Delaunay


Chronological Thread 
  • From: neoideo <>
  • To:
  • Subject: [cgal-discuss] Re: looking for method to convert 2D triangulation into Delaunay
  • Date: Tue, 22 May 2012 07:30:44 -0700 (PDT)



On Mon, May 21, 2012 at 2:47 PM, Daniel Duque [via cgal-discuss] <[hidden email]> wrote:
El 21/05/2012 19:49, neoideo escribió:
> Hello,
>
> Suppose i have a 2D triangulation loaded into cgal, from a file mymesh.off
> and the triangulation
> is not Delaunay.
>
> Then, my question:
> Is there any method (already implemented in CGAL) that improves the
> triangulation based on the Delaunay criteria??

Perhaps you can just read the positions of each vertex, not their
connectivities, then use them
to build a new Delaunay triangulation.


 Yes, indeed your solution works. However, i needed a faster method that could reuse the connectivity 
so i can compare performance and correctness against another method not in cgal. 
At least, with your solution, 
i can compare how exact is the other method against cgal delaunay mesh. But performance should be very slow on cgal side.



View this message in context: Re: looking for method to convert 2D triangulation into Delaunay
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.16.

Top of Page