Enumerating the k closest pairs optimally

Authors:
H.-P. Lenhof;M. Smid
Affiliations:
Max-Planck-Inst. fur Informatik, Saarbrucken, Germany;Max-Planck-Inst. fur Informatik, Saarbrucken, Germany
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 2

Approximate k -Closest-Pairs with Space Filling Curves

DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let S be a set of n points in D-dimensional space, where D is a constant, and let k be an integer between 1 and (/sub 2//sup n/) An algorithm is given that computes the k closest pairs in the set S in O(nlogn+k) time, using O(n+k) space. The algorithm fits in the algebraic decision tree model and is, therefore, optimal.