Fast spatial decomposition and closest pair computation for limited precision input

DOI10.1007/S004530010040zbMATH Open0960.68158OpenAlexW1493519151MaRDI QIDQ1587778FDOQ1587778

Authors: J. Reif, Stephen R. Tate 

Publication date: 3 December 2000

Published in: Algorithmica (Search for Journal in Brave)

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

Recommendations

• Speeding up spatial approximation search in metric spaces
• Approximate closest-point queries in high dimensions
• Efficient computation of a proximity matching in spatial databases
• Decomposition methods for sparse matrix nearness problems
• Decomposable algorithms for nearest neighbor computing
• scientific article; zbMATH DE number 1832337
• Fast partial distance estimation and applications
• Improvement of the fast exact pairwise-nearest-neighbor algorithm
• Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
• Efficient distance computation in configuration space

zbMATH Keywords

geometric closet pair problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (1)

• Speeding up spatial approximation search in metric spaces

This page was built for publication: Fast spatial decomposition and closest pair computation for limited precision input

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