Incremental convex hull algorithm; Michael Kallay ( Convex Hull)

From Algorithm Wiki

Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n log n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1984 == Reference == https://www.sciencedirect.com/science/article/pii/002001908490084X")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n log n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1984

Reference

https://www.sciencedirect.com/science/article/pii/002001908490084X

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Incremental_convex_hull_algorithm;_Michael_Kallay_(_Convex_Hull)&oldid=45231"