Searching dynamic point sets in spaces with bounded doubling dimension

Abstract

We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data structure has linear size and supports insertions and deletions in O(log n) time, and finds a (1+&#949;)-approximate nearest neighbor in time O(log n) + (1/&#949;)<sup>O(1)</sup… (More)
DOI: 10.1145/1132516.1132599

Topics

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

72 Citations

Semantic Scholar estimates that this publication has 72 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Cole2006SearchingDP, title={Searching dynamic point sets in spaces with bounded doubling dimension}, author={Richard Cole and Lee-Ad Gottlieb}, booktitle={STOC}, year={2006} }