CGAL users discussion list

[Ashwin Nanjappa <>]

Hi,

I know that CGAL uses randomized incremental method for 3D Delaunay 
triangulation. After point location, I was interested to see how the new 
point is inserted and how the neighboring cells are affected by this. I 
looked at the code, and it looks similar to the local flipping and 
neighbor changes that I know from 2D Delaunay triangulation.

Neither the CGAL code nor documentation mentions how this is exactly done. 
Is there any paper/book that proves and details how the incremental method 
works in 3D? Also, does this mean that any 3D tetrahedralization can be 
converted to 3D Delaunay by flipping? I know this is true for a planar 
point set, but is this true for 3D too?

(Please excuse me if my query is a bit off-topic.)

Regards,
~ash