Experimental Algorithms (SEA 2010); Lecture Notes in Computer Science 6049, pp. 462–473
Research account
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere
We propose two ways to compute 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. We use the so-called space of circles as mathematical background for this work. We present a fully robust implementation built upon existing generic algorithms provided by the CGAL library. The efficiency of the implementation is established by benchmarks.
The paper has been presented at SEA’10 (old WEA), and published in the Proceedings of the 9th International Symposium on Experimental Algorithms, volume 6049 of Lecture Notes in Computer Science, pages 462-473, 2010 , and can be found here.