HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Book sections

Delaunay triangulation and randomized constructions

Olivier Devillers 1
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry, Inria Nancy - Grand Est
Abstract : The Delaunay triangulation and the Voronoi diagram are two classic geometric structures in the field of computational geometry. Their success can perhaps be attributed to two main reasons: Firstly, there exist practical, efficient algorithms to construct them; and secondly, they have an enormous number of useful applications ranging from meshing and 3D-reconstruction to interpolation.
Keywords : Convex hull Randomization Delaunay triangulation Voronoi diagram
Document type :
Book sections
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

vignette-d.png
vignette-d.png
https://hal.inria.fr/hal-01168575
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Friday, June 26, 2015 - 10:56:24 AM
Last modification on : Saturday, October 16, 2021 - 11:26:08 AM
Long-term archiving on: : Friday, October 9, 2015 - 6:20:18 PM

Files

Vignette du document
encyclopedia-delaunay.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | UNIV-LORRAINE | INRIA2 | LORIA-ALGO | LORIA

Citation

Olivier Devillers. Delaunay triangulation and randomized constructions. Encyclopedia of Algorithms, Springer, 2014, ⟨10.1007/978-3-642-27848-8_711-1⟩. ⟨hal-01168575⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

150

Files downloads

898

Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/