The art gallery theorem for polyominoes
From MaRDI portal
Publication:715003
DOI10.1007/s00454-012-9429-1zbMath1251.05029OpenAlexW2016780725MaRDI QIDQ715003
Justin Iwerks, Joseph S. B. Mitchell, Joondong Kim, Mohammad T. Irfan, Therese C. Biedl
Publication date: 15 October 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-012-9429-1
Related Items (10)
Guarding monotone art galleries with sliding cameras in linear time ⋮ Guarding polyominoes, polycubes and polyhypercubes ⋮ Art gallery problem with rook and queen vision ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes ⋮ A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras ⋮ The dispersive art gallery problem ⋮ On \(r\)-guarding SCOTs -- a new family of orthogonal polygons ⋮ Perfect graphs and guarding rectilinear art galleries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An alternative proof of the rectilinear art gallery theorem
- Guarding galleries and terrains
- Approximation algorithms for art gallery problems in polygons
- An efficient algorithm for guard placement in polygons with holes
- On guarding the vertices of rectilinear domains
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
- Traditional Galleries Require Fewer Watchmen
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- A Short Proof of the Rectilinear Art Gallery Theorem
- Computational complexity of art gallery problems
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Guarding polyominoes
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
- Automata, Languages and Programming
This page was built for publication: The art gallery theorem for polyominoes
