Skip to Main content Skip to Navigation
Reports

Robust and Efficient Delaunay triangulations of points on or close to a sphere

Manuel Caroli 1 Pedro Machado Manhães de Castro 1 Sebastien Loriot 2 Monique Teillaud 1 Camille Wormser 3
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
2 ABS - Algorithms, Biology, Structure
CRISAM - Inria Sophia Antipolis - Méditerranée
3 D-INFK - Department of Computer Science [ETH Zürich]
Abstract : 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.
Keywords : Computational Geometry Delaunay Triangulation Voronoi Diagram Sphere Space of Circles Exact Geometric Computing CGAL
Document type :
Reports
Complete list of metadatas
https://hal.inria.fr/inria-00405478
Contributor : Manuel Caroli <>
Submitted on : Monday, July 27, 2009 - 2:43:15 PM
Last modification on : Monday, December 14, 2020 - 4:46:29 PM
Long-term archiving on: : Saturday, November 26, 2016 - 10:54:32 AM

File

Vignette du document
RR-7004.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00405478, version 3

Collections

INRIA-RRRT

Citation

Manuel Caroli, Pedro Machado Manhães de Castro, Sebastien Loriot, Monique Teillaud, Camille Wormser. Robust and Efficient Delaunay triangulations of points on or close to a sphere. [Research Report] RR-7004, 2009. ⟨inria-00405478v3⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

47

Files downloads

1601

 

Contact                    Legal Notice                    Personal Data