On the Most Likely Voronoi Diagram and Nearest Neighbor Searching

DOI10.1142/S0218195916600025zbMath1407.68517OpenAlexW2605948429MaRDI QIDQ2988722

Kevin Verbeek, Subhash Suri

Publication date: 19 May 2017

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195916600025

zbMATH Keywords

Voronoi diagramuncertain datanearest neighborsgeometric data structuresPareto sets

Mathematics Subject Classification ID

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

Related Items (2)

Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ r-Gatherings on a star and uncertain r-gatherings on a line

Cites Work

• Smoothed analysis of probabilistic roadmaps
• Quasi-optimal range searching in spaces of finite VC-dimension
• Nearest-neighbor searching under uncertainty. I
• On the Most Likely Convex Hull of Uncertain Points
• Visibility maps of realistic terrains have linear smoothed complexity
• Range searching on uncertain data
• The height of a random binary search tree
• Smoothed analysis of algorithms
• Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
• A note on the height of binary search trees
• Nearest-Neighbor Searching Under Uncertainty II
• Closest Pair and the Post Office Problem for Stochastic Points
• Algorithms – ESA 2004
• Algorithms - ESA 2003

This page was built for publication: On the Most Likely Voronoi Diagram and Nearest Neighbor Searching