Expected-Case Complexity of Approximate Nearest Neighbor Searching
From MaRDI portal
Publication:4706232
DOI10.1137/S0097539799366340zbMath1046.68041OpenAlexW2075261405MaRDI QIDQ4706232
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (1)
This page was built for publication: Expected-Case Complexity of Approximate Nearest Neighbor Searching