Graham (2-dimensional Convex Hull)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1972
Reference
https://www.sciencedirect.com/science/article/pii/0020019072900452?via%3Dihub