O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2verdicts
UNVERDICTED 2representative citing papers
A (2+ε)-approximation algorithm for vertex guarding weakly visible polygons, plus related results for boundary guards and chord-visible polygons.
citing papers explorer
-
The Contiguous Art Gallery Problem is in {\Theta}(n log n)
O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
-
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
A (2+ε)-approximation algorithm for vertex guarding weakly visible polygons, plus related results for boundary guards and chord-visible polygons.