eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2014-12-12
315
326
10.4230/LIPIcs.FSTTCS.2014.315
article
Robust Proximity Search for Balls Using Sublinear Space
Har-Peled, Sariel
Kumar, Nirman
Given a set of n disjoint balls b_1, ..., b_n in R^d, we provide a data structure, of near linear size, that can answer (1 +- epsilon)-approximate k-th-nearest neighbor queries in O(log(n) + 1/epsilon^d) time, where k and epsilon are provided at query time. If k and epsilon are provided in advance, we provide a data structure to answer such queries, that requires (roughly) O(n/k) space; that is, the data structure has sublinear space requirement if k is sufficiently large.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol029-fsttcs2014/LIPIcs.FSTTCS.2014.315/LIPIcs.FSTTCS.2014.315.pdf
Approximate Nearest neighbors
algorithms
data structures