New answers tagged convex-hull
2
votes
What is the optimal algorithm for merging an arbitrary number of convex hulls?
the result will not be linear.
Doing the merge between partial result and the next hull will be $O(x_{i-1}+m_i)$ where $x_{i-1}$ is the amount of points in the partial result.
So doing the merge ...
Top 50 recent answers are included
Related Tags
convex-hull × 43computational-geometry × 25
algorithms × 18
optimization × 8
linear-programming × 5
complexity-theory × 4
time-complexity × 3
algorithm-analysis × 3
np-hard × 2
binary-search × 2
data-structures × 1
np-complete × 1
runtime-analysis × 1
sorting × 1
dynamic-programming × 1
proof-techniques × 1
discrete-mathematics × 1
matrices × 1
integer-programming × 1
linear-algebra × 1
floating-point × 1
game-theory × 1
modelling × 1
planar-graphs × 1
polygons × 1