Closest pair and the post office problem for stochastic points
From MaRDI portal
Publication:390124
DOI10.1016/j.comgeo.2012.10.010zbMath1315.65018MaRDI QIDQ390124
Subhash Suri, Timothy M. Chan, Pegah Kamousi
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.10.010
data structures; computational geometry; approximation algorithms; probabilistic optimization; closest pair; post office problem
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W25: Approximation algorithms