Andrew's algorithm (2-dimensional Convex Hull)

From Algorithm Wiki

Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1979 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0020019079900723")

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

Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O(n)$ words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1979

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0020019079900723

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Andrew%27s_algorithm_(2-dimensional_Convex_Hull)&oldid=44575"