Shamos; Hoey (2-dimensional space, Euclidean metric Closest Pair Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words (Voronoi diagrams require O(n) space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1975 == Reference == https://ieeexplore.ieee.org/document/4567872") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n | $O(n \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:55, 10 April 2023
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ words
(Voronoi diagrams require O(n) space)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1975