Contiguous boundary guarding of a simple polygon can be solved optimally in polynomial time, and the tight worst-case guard number is about n/2 for an n-corner polygon.
The art gallery theorem: its variations, applications and algorithmic aspects
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Contiguous Boundary Guarding
Contiguous boundary guarding of a simple polygon can be solved optimally in polynomial time, and the tight worst-case guard number is about n/2 for an n-corner polygon.