Robust and Efficient Delaunay triangulations of points on or close to a sphere - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

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

Manuel Caroli
  • Function : Author
  • PersonId : 843218
Sebastien Loriot
  • Function : Author
  • PersonId : 836959
Monique Teillaud

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.
Fichier principal
Vignette du fichier
RR-7004.pdf (1.76 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00405478 , version 1 (20-07-2009)
inria-00405478 , version 2 (27-07-2009)
inria-00405478 , version 3 (27-07-2009)
inria-00405478 , version 4 (17-12-2009)

Identifiers

  • HAL Id : inria-00405478 , version 4

Cite

Manuel Caroli, Pedro Machado Manhães de Castro, Sebastien Loriot, Olivier Rouiller, Monique Teillaud, et al.. Robust and Efficient Delaunay triangulations of points on or close to a sphere. [Research Report] RR-7004, INRIA. 2009. ⟨inria-00405478v4⟩
1085 View
3183 Download

Share

Gmail Facebook Twitter LinkedIn More