An efficient implementation of Delaunay triangulations in medium dimensions - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

An efficient implementation of Delaunay triangulations in medium dimensions

(1) , (1)
1
Samuel Hornus
Jean-Daniel Boissonnat
  • Function : Author
  • PersonId : 830857

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

Dates and versions

inria-00343188 , version 1 (30-11-2008)

Identifiers

  • HAL Id : inria-00343188 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More