Guarding orthogonal prison yards: an upper bound

MaRDI QIDQ2869334zbMATH OpenFDO

Authors T. S. Michael, Val Pinciu

Publication date 3 January 2014

Published in Congressus Numerantium (Search for Journal in Brave)

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Recommendations

• scientific article; zbMATH DE number 975335
• scientific article; zbMATH DE number 1728322
• Orthogonal art galleries, holes, and reflex guards
• The prison yard problem
• New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision

Cited in

(6)

• A note on the contractions for orthogonal polygons
• How to guard orthogonal polygons: diagonal graphs and vertex covers
• Vertex guarding for dynamic orthogonal art galleries
• Orthogonal art galleries, holes, and reflex guards
• New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
• Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards

This page was built for publication: Guarding orthogonal prison yards: an upper bound

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