Andrew's algorithm (2-dimensional Convex Hull)

From Algorithm Wiki
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/science/article/pii/0020019079900723