Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(logn)$ per operation, $O(n*log(n)$) total

Space Complexity

$O(n)$ words

(easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1979

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/359131.359132