A note on point location in Delaunay triangulations of random points

DOI10.1007/PL00009234MaRDI QIDQ1277376zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
• On degrees in random triangulations of point sets
• On degrees in random triangulations of point sets
• scientific article; zbMATH DE number 1786679
• Random triangulations of planar points sets
• Simple and efficient distribution-sensitive point location in triangulations
• Randomized incremental construction of Delaunay triangulations of nice point sets
• Randomized incremental construction of Delaunay triangulations of nice point sets
• On the convex hull of random points in a polytope
• Practical distribution-sensitive point location in triangulations

Cited in

(14)

• Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
• Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
• Expected time analysis for Delaunay point location
• Boundary layer mesh generation with fast collision detection
• Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
• Fast dynamic grid deformation based on Delaunay graph mapping
• Practical distribution-sensitive point location in triangulations
• Fast range searching with Delaunay triangulations
• THE DELAUNAY HIERARCHY
• scientific article; zbMATH DE number 2243637 (Why is no real title available?)
• On Lawson's oriented walk in random Delaunay triangulations.
• The stochastic walk algorithms for point location in pseudo-triangulations
• Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
• On the stabbing number of a random Delaunay triangulation

This page was built for publication: A note on point location in Delaunay triangulations of random points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277376)