Title :
Enumerating the k closest pairs optimally
Author :
Lenhof, Hans-Peter ; Smid, Michiel
Author_Institution :
Max-Planck-Inst. fur Informatik, Saarbrucken, Germany
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 (2n) 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
Keywords :
computational complexity; computational geometry; D-dimensional space; algebraic decision tree model; k closest pairs; time complexity; Algorithm design and analysis; Contracts; Testing;
Conference_Titel :
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-8186-2900-2
DOI :
10.1109/SFCS.1992.267752
