Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(kn logn)$ == 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 == 1976 == Reference == https://dl.acm.org/citation.cfm?id=803652") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(kn | $O(kn \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:55, 10 April 2023
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
1976