Chan's algorithm (2-dimensional; 3-dimensional Convex Hull)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n log h)$ == Space Complexity == $O(n)$ words (https://link.springer.com/article/10.1007/BF02712873) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1996 == Reference == https://link.springer.com/article/10.1007/BF02712873")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n log h)$

Space Complexity

$O(n)$ words

(https://link.springer.com/article/10.1007/BF02712873)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1996

Reference

https://link.springer.com/article/10.1007/BF02712873

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chan%27s_algorithm_(2-dimensional;_3-dimensional_Convex_Hull)&oldid=44577"