Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
Jump to navigation
Jump to search
Time Complexity
$O(kn \log\log n+n*{3}^k)$
Space Complexity
$O(n)$ words
(can be easily derived? (can re-use space from recursive calls))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1979
Reference
https://www.sciencedirect.com/science/article/pii/0020019079900851