Chan's algorithm (2-dimensional; 3-dimensional Convex Hull)
Jump to navigation
Jump to search
Time Complexity
$O(n log h)$
Space Complexity
$O(n)$ words
(https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF02712873)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1996
Reference
https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF02712873