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

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.
Document type :
Reports
[Research Report] RR-7004, 2009


https://hal.inria.fr/inria-00405478
Contributor : Manuel Caroli <>
Submitted on : Thursday, December 17, 2009 - 4:29:52 PM
Last modification on : Thursday, December 17, 2009 - 9:17:25 PM

File

RR-7004.pdf
fileSource_public_author

Identifiers

  • HAL Id : inria-00405478, version 4

Collections

Citation

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, 2009. <inria-00405478v4>

Export

Share

Metrics

Consultation de
la notice

473

Téléchargement du document

208