F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
Jump to navigation
Jump to search
Time Complexity
$O(kn \log n)$
Space Complexity
$O(kn)$? words
(keep track of all sorted lists in each dimension; re-use space from recursive calls)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1986