Title

Robust Proximity Search for Balls Using Sublinear Space

Abstract

Given a set of n disjoint balls b1, ⋯ , bn in IRd, we provide a data structure of near linear size that can answer (1 ± ε) -approximate kth-nearest neighbor queries on the balls in O(log n+ 1 / εd) time, where k and ε may be provided at query time. If k and ε are provided in advance, we provide a data structure to answer such queries requiring O(n / k) space; that is, the data structure requires sublinear space if k is sufficiently large.

Publication Title

Algorithmica

Share

COinS