CGAL users discussion list

[Olivier Devillers <>]

Robert Bryce a écrit :
> I’ve got a current code set based on that written by Olivie Devillers 
> some 10 years ago.  
I am no longer using this code either,
the algorithm in this (these) old codes

If you refer to the Delaunay tree,
http://www-sop.inria.fr/prisme/logiciel/del-tree/index.html.fr
robustness issues was not addressed there.


If you refer to the Delaunay hierarchy,
http://www-sop.inria.fr/prisme/logiciel/del-hierarchy/index.html.fr
robustness was much better (should not crash insertion only,
and deletion were reasonably robust).
Anyway, the Delaunay hierarchy is implemented in CGAL,
thus the time performances are of the same order
of magnitude for big set of points.
(and CGAL offers better genericity, and other strategies
like spatial sorting for big set of points known in advance).