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

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/doi/abs/10.1145/359131.359132")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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/doi/abs/10.1145/359131.359132