Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere
Abstract
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.
Fichier principal
SEA10.pdf (503.34 Ko)
Télécharger le fichier
tri2.png (318.26 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image