Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards

DOI10.1007/S00373-024-02880-8MaRDI QIDQ6661734

J. M. Díaz-Báñez, A. Stevens, Oriol Solé-Pi, Mario A. Lopez, Adriana Ramírez-Vigueras, Nestaly Marín, Paul Horn, J. Urrutia

Publication date: 13 January 2025

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

matchingsart gallery problemorthogonal polygonsunit-length edges

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The art gallery theorem for polyominoes
• An alternative proof of the rectilinear art gallery theorem
• A short proof of Chvatal's Watchman Theorem
• Edge guards in rectilinear polygons
• A combinatorial theorem in plane geometry
• Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
• Guarding orthogonal art galleries with sliding cameras
• On guarding the vertices of rectilinear domains
• On representatives of subsets.
• Guarding Thin Orthogonal Polygons Is Hard
• GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
• Traditional Galleries Require Fewer Watchmen
• A Short Proof of the Rectilinear Art Gallery Theorem
• A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems

This page was built for publication: Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards

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