Expected-Case Complexity of Approximate Nearest Neighbor Searching

DOI10.1137/S0097539799366340zbMATH Open1046.68041OpenAlexW2075261405MaRDI QIDQ4706232FDOQ4706232

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

Recommendations

• Publication:4952641
• scientific article; zbMATH DE number 1893569
• scientific article; zbMATH DE number 437552
• Approximate nearest neighbor queries revisited
• scientific article; zbMATH DE number 1003290

zbMATH Keywords

approximationnearest neighbor searchingexpected-case analysispriority searchsliding-midpoint tree

Mathematics Subject Classification ID

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

Cited In (5)

• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nearest-neighbor searching under uncertainty. I
• Title not available (Why is that?)

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)