Fast spatial decomposition and closest pair computation for limited precision input

DOI10.1007/S004530010040zbMATH Open0960.68158OpenAlexW1493519151MaRDI QIDQ1587778

John H. 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

zbMATH Keywords

geometric closet pair problem

Mathematics Subject Classification ID

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

Related Items (1)

Speeding up spatial approximation search in metric spaces

Recommendations

• Unnamed Item 👍 👎
• Decomposable algorithms for nearest neighbor computing 👍 👎
• Efficient distance computation in configuration space 👍 👎
• Improvement of the fast exact pairwise-nearest-neighbor algorithm 👍 👎
• Approximate closest-point queries in high dimensions 👍 👎
• Fast Partial Distance Estimation and Applications 👍 👎
• Decomposition Methods for Sparse Matrix Nearness Problems 👍 👎
• Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases 👍 👎
• Efficient computation of a proximity matching in spatial databases 👍 👎
• 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