Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Paper
Deferred data structure for the nearest neighbor problem
Abstract
Let S be a set of n points in the plane. We show how to process, on-line, a sequence of r point queries for computing their nearest neighbors in S, in time Θ((n + r) log min(n, r)). This settles an open problem posed by Karp. Motwani and Raghavan. © 1991.
Related
Thomas M. Cheng
IT Professional
Leo Liberti, James Ostrowski
Journal of Global Optimization
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems