On r-guarding SCOTs -- a new family of orthogonal polygons

DOI10.1007/978-3-031-20624-5_43MaRDI QIDQ6164011zbMATH OpenOpenAlexFDO

Authors Vasco Cruz, Ana Paula Tomás

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

art gallery problemcomputational complexityorthogonal polygons

Mathematics Subject Classification ID

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

Cites work

• A combinatorial theorem in plane geometry
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Computational complexity of art gallery problems
• Computational complexity of the r-visibility guard set problem for polyominoes
• Guarding polyominoes
• Guarding thin orthogonal polygons is hard
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• On r-guarding thin orthogonal polygons
• On guarding the vertices of rectilinear domains
• On orthogonally guarding orthogonal polygons with bounded treewidth
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• The art gallery theorem for polyominoes
• Traditional Galleries Require Fewer Watchmen
• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons

Cited in

(1)

• Guarding offices with maximum dispersion

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164011)