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.
and Mitchell, Joseph S
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
-
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.