CGAL users discussion list

[wen <>]

Hi, 
I am learning geometric modelling and I want to do some research on 3D
Delaunay. I just tried 3d delaunay function  provided by CGAL and was
impressed by its high efficiency. I implemented 3D delaunay myself with
Incremental  Insertion Algorithms, but the efficiency was much less than
CGAL. 
In addition, it needs to add eight auxiliary bounding points before point
insertion during 3D Delaunay  triangulation. In my program, the coordinates
of the eight points was configured with the rules that the bounding  box
formed by the eight points can contain the whole point set. But the
triangulation result is a bit different on  surface compared with 3D
delaunay of CGAL. 

So, I wonder how to find the exact algorithm and references of CGAL's 3D
delaunay function. 

Thanks for any help.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/The-exact-algorithm-and-references-of-CGAL-s-3D-Delaunay-function-tp4662096.html
Sent from the cgal-discuss mailing list archive at Nabble.com.