An alternative proof of the rectilinear art gallery theorem

DOI10.1007/BF01918136zbMATH Open0542.51020OpenAlexW2063453634MaRDI QIDQ795339FDOQ795339

Joseph O'Rourke

Publication date: 1983

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01918136

Recommendations

• A simple proof of the rectilinear art gallery theorem
• scientific article
• Generalized guarding and partitioning for rectilinear polygons
• scientific article
• A Short Proof of the Rectilinear Art Gallery Theorem

zbMATH Keywords

partitioningcutsrectilinear polygonguardreflex vertices

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cites Work

• A short proof of Chvatal's Watchman Theorem
• Traditional Galleries Require Fewer Watchmen
• A combinatorial theorem in plane geometry
• Title not available (Why is that?)

Cited In (23)

• How to guard orthogonal polygons: diagonal graphs and vertex covers
• Hiding people in polygons
• On the Enumeration of Permutominoes
• Approximation algorithms for art gallery problems in polygons
• Approximability of guarding weak visibility polygons
• Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
• An ``Art Gallery Theorem for pyramids
• Area bounds of rectilinear polygons realized by angle sequences
• A Short Proof of the Rectilinear Art Gallery Theorem
• On Some City Guarding Problems
• A simple proof of the rectilinear art gallery theorem
• New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
• The art gallery theorem for polyominoes
• The dispersive art gallery problem
• Tight bounds for beacon-based coverage in simple rectilinear polygons
• Title not available (Why is that?)
• Guarding galleries and terrains
• Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards
• Edge guards in rectilinear polygons
• Vertex Guarding for Dynamic Orthogonal Art Galleries
• Perfect graphs and guarding rectilinear art galleries
• On covering orthogonal polygons with star-shaped polygons
• Generalized guarding and partitioning for rectilinear polygons

This page was built for publication: An alternative proof of the rectilinear art gallery theorem

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