Published in

Encyclopedia of Algorithms, p. 1-7

DOI: 10.1007/978-3-642-27848-8_711-1

Encyclopedia of Algorithms, p. 519-524

DOI: 10.1007/978-1-4939-2864-4_711

Links

Tools

Export citation

Search in Google Scholar

Delaunay triangulation and randomized constructions

Journal article published in 2014 by Olivier Devillers ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.