A new O(log n)-approximation algorithm for minimum convex cover of polygons that runs substantially faster than the prior O(n^29 log n) bound by reducing the problem to maximum-weight paths in visibility DAGs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
A new O(log n)-approximation algorithm for minimum convex cover of polygons that runs substantially faster than the prior O(n^29 log n) bound by reducing the problem to maximum-weight paths in visibility DAGs.