Probabilistic analysis of an algorithm for solving the k-dimensional all-nearest-neighbors problem by projection

DOI10.1007/BF01933171MaRDI QIDQ1182607zbMATH OpenFDO

Authors Frank Bartling, Klaus Hinrichs

Publication date 28 June 1992

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01933171

zbMATH Keywords

all-nearest neighbors problemplane-sweep algorithmprobabilistic analysis of algorithmsproximity problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4074476
• scientific article; zbMATH DE number 437552
• A randomized approximate nearest neighbors algorithm

Cites work

• An Algorithm for Finding Nearest Neighbors
• Approximate distributions of order statistics. With applications to nonparametric statistics
• scientific article; zbMATH DE number 3692659 (Why is no real title available?)
• On conditional distributions of nearest neighbors

Cited in

(6)

• An O(n log n) algorithm for the all-nearest-neighbors problem
• A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem
• An efficient \(O(1)\) time 3D all nearest neighbor algorithm from image processing perspective
• scientific article; zbMATH DE number 4074476 (Why is no real title available?)
• scientific article; zbMATH DE number 1830741 (Why is no real title available?)
• A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited

This page was built for publication: Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection

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