Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere

(1) , (1) , (1) , (1) , (1) , (2)
1
2

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
Vignette du fichier
SEA10.pdf (503.34 Ko) Télécharger le fichier
Vignette du fichier
tri2.png (318.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-03469649 , version 1 (07-12-2021)

Identifiers

  • HAL Id : hal-03469649 , version 1

Cite

Manuel Caroli, Pedro M M de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, et al.. Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere. Symposium on Experimental Algorithms, 2010, Naples, Italy. pp.462-473. ⟨hal-03469649⟩

Collections

INRIA INRIA2 ANR
20 View
93 Download

Share

Gmail Facebook Twitter LinkedIn More