The contiguous art gallery problem for simple polygons is solvable in O(k* n^5 log n) arithmetic operations, placing the problem in P.
Common tangents of two disjoint polygons in linear time and constant workspace
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
-
The Contiguous Art Gallery Problem is Solvable in Polynomial Time
The contiguous art gallery problem for simple polygons is solvable in O(k* n^5 log n) arithmetic operations, placing the problem in P.