Reverse nearest neighbor queries in fixed dimension
Computational Geometry
2014-01-31 v3 Data Structures and Algorithms
Abstract
Reverse nearest neighbor queries are defined as follows: Given an input point-set P, and a query point q, find all the points p in P whose nearest point in P U {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).
Cite
@article{arxiv.0905.4441,
title = {Reverse nearest neighbor queries in fixed dimension},
author = {Otfried Cheong and Antoine Vigneron and Juyoung Yon},
journal= {arXiv preprint arXiv:0905.4441},
year = {2014}
}
Comments
7 pages, 3 figures; typos corrected; more background material on compressed quadtrees