2-dimensional Convex Hull, Dynamic
Here, the input points may be sequentially inserted or deleted, and the convex hull must be updated after each insert/delete operation.
Parameters
- : number of line segments
- : number of points on the convex hull
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| Dynamic 2-d Convex Hull, Overmars and van Leeuwen | 1980 | O(log^2(n)) per operation, O(n*log^2(n)) total |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Displaying 1 of 1 other relevant algorithms