A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
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
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004