On the Most Likely Voronoi Diagramand Nearest Neighbor Searching

DOI10.1007/978-3-319-13075-0_27zbMath1391.68117OpenAlexW2077178480MaRDI QIDQ2942640

Kevin Verbeek, Subhash Suri

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_27

Mathematics Subject Classification ID

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

Related Items (8)

On the separability of stochastic geometric objects, with applications ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Computing the Center of Uncertain Points on Tree Networks ⋮ Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ Computing the center of uncertain points on tree networks ⋮ Covering uncertain points in a tree ⋮ The most-likely skyline problem for stochastic points ⋮ On the expected diameter, width, and complexity of a stochastic convex hull

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