journalarticle
Navigating nets: simple algorithms for proximity search
ACM-SIAM Symposium on Discrete Algorithms2004-01-11 407 citations12 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis work presents a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximity search and updates to S (insertions and deletions) and is essentially optimal in a certain model of distance computation. (Semantic Scholar)