Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations

DOI10.1016/S0925-7721(98)00035-2MaRDI QIDQ1286475zbMATH OpenFDO

Authors E. P. Mücke, Isaac Saias, Binhai Zhu

Publication date 20 October 1999

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(98)00035-2

zbMATH Keywords

Delaunay triangulations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A note on point location in Delaunay triangulations of random points
• On Lawson's oriented walk in random Delaunay triangulations.
• Expected time analysis for Delaunay point location
• Fast range searching with Delaunay triangulations
• Practical distribution-sensitive point location in triangulations

Cited in

(17)

• A note on point location in Delaunay triangulations of random points
• A fast boundary integral equation method for point location problem
• Expected time analysis for Delaunay point location
• High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes
• Boundary layer mesh generation with fast collision detection
• Practical distribution-sensitive point location in triangulations
• Fast range searching with Delaunay triangulations
• Optimal Delaunay and Voronoi quantization schemes for pricing American style options
• scientific article; zbMATH DE number 6693709 (Why is no real title available?)
• Computational Geometry Methods and Intelligent Computing
• Generation of boundary layer meshes by the enhanced jump-and-walk method with a fast collision detecting algorithm
• Simple and efficient distribution-sensitive point location in triangulations
• Distribution-sensitive construction of the greedy spanner
• On Lawson's oriented walk in random Delaunay triangulations.
• A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
• The stochastic walk algorithms for point location in pseudo-triangulations
• HCPO: an efficient insertion order for incremental Delaunay triangulation

Describes a project that uses

Uses Software

• Triangle

This page was built for publication: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations

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