Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata


https://hal.inria.fr/hal-03469649
Contributor : Monique Teillaud Connect in order to contact the contributor
Submitted on : Tuesday, December 7, 2021 - 7:09:51 PM
Last modification on : Wednesday, February 2, 2022 - 3:51:04 PM

Files

SEA10.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03469649, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

18

Files downloads

59