Graham (2-dimensional Convex Hull)

From Algorithm Wiki

Revision as of 08:34, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1972

Reference

https://www.sciencedirect.com/science/article/pii/0020019072900452?via%3Dihub

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Graham_(2-dimensional_Convex_Hull)&oldid=47341"