 |
 |
 |
Reports
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.
Cited literature [32 references]
https://hal.inria.fr/inria-00405478
Contributor : Manuel Caroli Connect in order to contact the contributor
Submitted on : Thursday, December 17, 2009 - 4:29:52 PM
Last modification on : Thursday, May 27, 2021 - 1:54:05 PM
Long-term archiving on: : Saturday, November 26, 2016 - 3:20:55 PM
Contributor : Manuel Caroli Connect in order to contact the contributor
Submitted on : Thursday, December 17, 2009 - 4:29:52 PM
Last modification on : Thursday, May 27, 2021 - 1:54:05 PM
Long-term archiving on: : Saturday, November 26, 2016 - 3:20:55 PM
File
RR-7004.pdf
Files produced by the author(s)
