An efficient implementation of Delaunay triangulations in medium dimensions

Samuel Hornus 1 Jean-Daniel Boissonnat 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : We propose a new C++ implementation of the well-known incremental algorithm for the construction of Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is fully robust. Extensive comparisons have shown that our implementation outperforms the best currently available codes for convex hulls and Delaunay triagulations, and that it can be used for quite big input sets in spaces of dimensions up to 6.
Document type :
Reports
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00343188
Contributor : Samuel Hornus <>
Submitted on : Sunday, November 30, 2008 - 3:50:29 PM
Last modification on : Tuesday, June 18, 2019 - 3:38:04 PM
Long-term archiving on : Thursday, October 11, 2012 - 12:11:26 PM

File

RR-6743.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00343188, version 1

Collections

Citation

Samuel Hornus, Jean-Daniel Boissonnat. An efficient implementation of Delaunay triangulations in medium dimensions. [Research Report] RR-6743, INRIA. 2008, pp.15. ⟨inria-00343188⟩

Share

Metrics

Record views

452

Files downloads

1826