Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull)

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log^{2}(n)$) per operation, $O(n*log^{2}(n)$) total == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/002200008190012X?via%3Dihub")

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

Jump to navigation Jump to search

Time Complexity

$O(log^{2}(n)$) per operation, $O(n*log^{2}(n)$) total

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1980

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dynamic_2-d_Convex_Hull,_Overmars_and_van_Leeuwen_(2-dimensional_Convex_Hull,_Dynamic_Convex_Hull)&oldid=45070"