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

From Algorithm Wiki
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