Fast Construction of Nets in Low Dimensional Metrics, and Their Applications
Data Structures and Algorithms
2007-05-23 v3 Computational Geometry
Abstract
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain improved algorithms for the following problems: Approximate nearest neighbor search, well-separated pair decomposition, compact representation scheme, doubling measure, and computation of the (approximate) Lipschitz constant of a function. In all cases, the running (preprocessing) time is near-linear and the space being used is linear.
Cite
@article{arxiv.cs/0409057,
title = {Fast Construction of Nets in Low Dimensional Metrics, and Their Applications},
author = {Sariel Har-Peled and Manor Mendel},
journal= {arXiv preprint arXiv:cs/0409057},
year = {2007}
}
Comments
41 pages. Extensive clean-up of minor English errors