New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision

DOI10.1016/j.tcs.2021.06.012OpenAlexW3177426706MaRDI QIDQ2044958

Hemant Malik, Ovidiu Daescu

Publication date: 11 August 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.012

zbMATH Keywords

visibilityorthogonal polygonart gallery problemguardingmonotone polygon

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An alternative proof of the rectilinear art gallery theorem
• Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Traditional Galleries Require Fewer Watchmen
• Illumination of convex discs
• Illumination of Orthogonal Polygons with Orthogonal Floodlights
• A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems

This page was built for publication: New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision