On \(r\)-guarding SCOTs -- a new family of orthogonal polygons

DOI10.1007/978-3-031-20624-5_43OpenAlexW4313054113MaRDI QIDQ6164011

Ana Paula Tomás, Vasco Cruz

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20624-5_43

zbMATH Keywords

computational complexityart gallery problemorthogonal polygons

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The art gallery theorem for polyominoes
• A combinatorial theorem in plane geometry
• On guarding the vertices of rectilinear domains
• On orthogonally guarding orthogonal polygons with bounded treewidth
• Guarding Thin Orthogonal Polygons Is Hard
• Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes
• Traditional Galleries Require Fewer Watchmen
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• Computational complexity of art gallery problems
• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
• Guarding polyominoes
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: On \(r\)-guarding SCOTs -- a new family of orthogonal polygons