Subject: CGAL users discussion list
List archive
- From: animo <>
- To:
- Subject: [cgal-discuss] Delaunay_triangulation_3 algorithm
- Date: Sat, 11 Jan 2014 09:55:23 -0800 (PST)
Dear Guys!
I tried to find out which kind of algorithm CGAL uses to calculate the delaunay triangulation in 3D and how the dual function works to get the voronoi diagram. I could only find out that in 2D it uses the flip algorithm.
Does anyone know how CGAL computes this things or where to find this information
Cheers
I tried to find out which kind of algorithm CGAL uses to calculate the delaunay triangulation in 3D and how the dual function works to get the voronoi diagram. I could only find out that in 2D it uses the flip algorithm.
Does anyone know how CGAL computes this things or where to find this information
Cheers
View this message in context: Delaunay_triangulation_3 algorithm
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Delaunay_triangulation_3 algorithm, animo, 01/11/2014
- Re: [cgal-discuss] Delaunay_triangulation_3 algorithm, Olivier Devillers, 01/12/2014
- Re: [cgal-discuss] Delaunay_triangulation_3 algorithm, animo, 01/12/2014
- Re: [cgal-discuss] Delaunay_triangulation_3 algorithm, Olivier Devillers, 01/12/2014
Archive powered by MHonArc 2.6.18.