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.
Ntafos , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2verdicts
UNVERDICTED 2representative citing papers
Introduces segment watchman routes for multi-directional visibility and proves weak NP-hardness for min-max in simple polygons, NP-hardness for min-sum with holes, plus 2-approximations in simple 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.
-
Segment Watchman Routes
Introduces segment watchman routes for multi-directional visibility and proves weak NP-hardness for min-max in simple polygons, NP-hardness for min-sum with holes, plus 2-approximations in simple polygons.