Approximate closest-point queries in high dimensions

DOI10.1016/0020-0190(93)90222-UzbMath0795.68187MaRDI QIDQ1209329

Marshall W. Bern

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90222-u

zbMATH Keywords

data structures; computational geometry; pattern matching; quadtrees; closest-point queries

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68P05: Data structures

Related Items

Unnamed Item, On Locality-Sensitive Orderings and Their Applications, Smallest k-enclosing rectangle revisited, Decomposable algorithms for nearest neighbor computing, Approximate range searching in external memory, Chromatic nearest neighbor searching: A query sensitive approach, Approximate range searching, On approximate nearest neighbors under \(l_\infty\) norm, Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings, Smallest \(k\)-enclosing rectangle revisited, Concurrent linearizable nearest neighbour search in LockFree-kD-tree, An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN, A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization, On Locality-Sensitive Orderings and Their Applications, SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS

Cites Work

• An O(n log n) algorithm for the all-nearest-neighbors problem
• Quad trees: A data structure for retrieval by composite keys
• Optimal Expected-Time Algorithms for Closest Point Problems
• Multidimensional Searching Problems
• An Algorithm for Finding Best Matches in Logarithmic Expected Time