Abstract : 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.
https://hal.inria.fr/inria-00405478
Contributeur : Manuel Caroli
<>
Soumis le : jeudi 17 décembre 2009 - 16:29:52
Dernière modification le : samedi 20 octobre 2018 - 15:06:01
Document(s) archivé(s) le : samedi 26 novembre 2016 - 15:20:55
Manuel Caroli, Pedro Machado Manhães de Castro, Sebastien Loriot, Olivier Rouiller, Monique Teillaud, et al.. Robust and Efficient Delaunay triangulations of points on or close to a sphere. [Research Report] RR-7004, INRIA. 2009. 〈inria-00405478v4〉
