Work

Fast Construction of Nets in Low-Dimensional Metrics and Their Applications

Year: 2006
Type: article
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, spanner construction, 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.
Language: English
Open Access status: green
OpenAlex ID: W2045134120
FWCI: 19.56
Cites: 59
Cited by: 357
Related to: 10