Subject: CGAL users discussion list
List archive
- From: MudaBuda <>
- To:
- Subject: [cgal-discuss] Delaunay 2D triangulation
- Date: Mon, 18 Mar 2013 13:02:50 -0700 (PDT)
Hello!
Can you please tell me did you use Knuth's randomized incremental algorithm
for Delaunay triangulation?
Did you implemented the algorithm from this book that uses randomized
incremental algorithm?
"Computational Geometry Algorithms and Applications"
I ask this because I don't see where you implemented the first step of the
algorithm if you worked from this book. The first step is to find a large
triangle that will contain all the set points.
Thank you very much!
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Delaunay-2D-triangulation-tp4656986.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Delaunay 2D triangulation, MudaBuda, 03/18/2013
- Re: [cgal-discuss] Delaunay 2D triangulation, Olivier Devillers, 03/19/2013
Archive powered by MHonArc 2.6.18.