Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection
From MaRDI portal
Publication:1182607
DOI10.1007/BF01933171zbMath0736.68039MaRDI QIDQ1182607
Frank Bartling, Klaus Hinrichs
Publication date: 28 June 1992
Published in: BIT (Search for Journal in Brave)
probabilistic analysis of algorithmsplane-sweep algorithmall-nearest neighbors problemproximity problems
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
This page was built for publication: Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection