Jarvis (2-dimensional Convex Hull)

From Algorithm Wiki
Revision as of 07:54, 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(nh)$

Space Complexity

$O({1})$ words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1973

Reference

https://linkinghub.elsevier.com/retrieve/pii/0020019073900203