CGAL users discussion list

[Olivier Devillers <>]

Le 3/18/13 9:02 PM, MudaBuda a écrit :
> Hello!
>
> Can you please tell me did you use Knuth's  randomized incremental algorithm
> for Delaunay triangulation?
no
> Did you implemented the algorithm from this book that uses randomized
> incremental algorithm?
>
> "Computational Geometry Algorithms and Applications"
no
> 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!
this is implementation details about how to handle the convex hull boundary.
We prefer to use a dummy point at infinity (see the manual)

CGAL implements the Delaunay hierarchy (for dynamic updates and fast 
point location)
and spatial sorting (brio) for static construction of Delaunay 
triangulation.

Olivier