Skip to Content

Répondre au commentaire

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

dim 29-09-2013 L'équipe du PortailSIG
TitreRobust and Efficient Delaunay triangulations of points on or close to a sphere
Type de publicationJournal Article
Nouvelles publications2009
AuteursCaroli, Manuel, Pedro De M. M. Castro, Sebastien Loriot, Olivier Rouiller, Monique Teillaud, and Camille Wormser
Année de publication2009
Mots clésCGAL, Computational Geometry, Delaunay Triangulation, Exact Geometric Computing, Space of Circles, Sphere, Voronoi Diagram
Résumé

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.
URLhttp://hal.inria.fr/inria-00405478

Répondre



Theme by Dr. Radut.