%0 Journal Article
%D 2009
%T Robust and Efﬁcient Delaunay triangulations of points on or close to a sphere
%A Caroli, Manuel
%A Castro, Pedro M. M. De
%A Loriot, Sebastien
%A Rouiller, Olivier
%A Teillaud, Monique
%A Wormser, Camille
%K CGAL
%K Computational Geometry
%K Delaunay Triangulation
%K Exact Geometric Computing
%K Space of Circles
%K Sphere
%K Voronoi Diagram
%U http://hal.inria.fr/inria-00405478
%X We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed for the plane. The space of circles gives the mathematical background for this work. We implemented the two approaches in a fully robust way, building upon existing generic algorithms provided by the cgal library. The effciency and scalability of the method is shown by benchmarks.
%8 2009