Guarding polyominoes

DOI10.1145/1998196.1998261zbMath1283.68345OpenAlexW2294576824MaRDI QIDQ5404453

Justin Iwerks, Joseph S. B. Mitchell, Mohammad T. Irfan, Joondong Kim, Therese C. Biedl

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1998196.1998261

zbMATH Keywords

computational geometryNP-hardnessvisibility problemart gallery problempolyomino

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polyominoes (05B50)

Related Items (5)

Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes ⋮ The dispersive art gallery problem ⋮ On \(r\)-guarding SCOTs -- a new family of orthogonal polygons ⋮ Combinatorics and complexity of guarding polygons with edge and point 2-transmitters ⋮ The art gallery theorem for polyominoes

This page was built for publication: Guarding polyominoes