inria-00405478, version 4
Robust and Efficient Delaunay triangulations of points on or close to a sphere
Manuel Caroli
1Pedro M. M. De Castro
1Sebastien Loriot
2Olivier Rouiller 1Monique Teillaud
1Camille Wormser
a, 3
N° RR-7004 (2009)
Résumé : 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.
- a – ETH Zurich
- 1 : GEOMETRICA (INRIA Sophia Antipolis / INRIA Saclay - Ile de France)
- INRIA
- 2 : ABS (INRIA Sophia Antipolis)
- INRIA
- 3 : Department of Computer Science (ETH Zurich)
- ETH Zurich
- Domaine : Informatique/Géométrie algorithmique
- Mots-clés : Computational Geometry – Delaunay Triangulation – Voronoi Diagram – Sphere – Space of Circles – Exact Geometric Computing – CGAL
- Référence interne : RR-7004
- Versions disponibles : v1 (20-07-2009) v2 (27-07-2009) v3 (27-07-2009) v4 (17-12-2009)
- inria-00405478, version 4
- http://hal.inria.fr/inria-00405478
- oai:hal.inria.fr:inria-00405478
- Contributeur : Manuel Caroli
- Soumis le : Jeudi 17 Décembre 2009, 16:29:52
- Dernière modification le : Jeudi 17 Décembre 2009, 21:17:25






Documents associés
Exporter