Reporting neighbors in high-dimensional Euclidean space

DOI10.1137/1.9781611973105.56MaRDI QIDQ5741764zbMATH OpenOpenAlexFDO

Authors Dror Aiger, Haim Kaplan, Micha Sharir

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Reporting neighbors in high-dimensional Euclidean space
• scientific article; zbMATH DE number 437552
• scientific article; zbMATH DE number 1559575
• Approximate closest-point queries in high dimensions
• scientific article; zbMATH DE number 1775450

Cited in

(4)

• Reductions among high dimensional proximity problems
• Reporting neighbors in high-dimensional Euclidean space
• On Approximating the Average Distance Between Points
• scientific article; zbMATH DE number 1934540 (Why is no real title available?)

This page was built for publication: Reporting neighbors in high-dimensional Euclidean space

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