Robust and Efficient Delaunay triangulations of points on or close to a sphere
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|