Preparata and Hong (2-dimensional; 3-dimensional Convex Hull): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$?? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1977 == Reference == https://dl.acm.org/citation.cfm?id=359430") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$? words | ||
() | (Divide and conquer can be done in linear space total as space can be reused after conquer steps) | ||
== Description == | == Description == | ||
Latest revision as of 09:34, 10 April 2023
Time Complexity
$O(nlogn)$
Space Complexity
$O(n)$? words
(Divide and conquer can be done in linear space total as space can be reused after conquer steps)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1977