Expected-Case Complexity of Approximate Nearest Neighbor Searching

DOI10.1137/S0097539799366340MaRDI QIDQ4706232zbMATH OpenOpenAlexFDO

Authors Sunil Arya, Ho-Yam Addy Fu

Publication date 19 June 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539799366340

zbMATH Keywords

approximationexpected-case analysisnearest neighbor searchingpriority searchsliding-midpoint tree

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1445326
• An empirical study of a new approach to nearest neighbor searching
• scientific article; zbMATH DE number 437552
• Approximate nearest neighbor queries revisited
• scientific article; zbMATH DE number 1003290

Cited in

(5)

• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• Nearest-neighbor searching under uncertainty. I
• A case study in comparison based complexity: Finding the nearest value(s)
• The analysis of a probabilistic approach to nearest neighbor searching
• scientific article; zbMATH DE number 1445326 (Why is no real title available?)

This page was built for publication: Expected-Case Complexity of Approximate Nearest Neighbor Searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706232)