A note on point location in Delaunay triangulations of random points

DOI10.1007/PL00009234zbMath0914.68201OpenAlexW2029439570WikidataQ29395717 ScholiaQ29395717MaRDI QIDQ1277376

Luc P. Devroye, Binhai Zhu, E. P. Mücke

Publication date: 2 February 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009234

zbMATH Keywords

Delaunay triangulationpoint location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Expected time analysis for Delaunay point location ⋮ Practical distribution-sensitive point location in triangulations ⋮ Boundary layer mesh generation with fast collision detection ⋮ Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ THE DELAUNAY HIERARCHY ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions ⋮ Efficiently navigating a random Delaunay triangulation ⋮ Fast dynamic grid deformation based on Delaunay graph mapping