Traditional Galleries Require Fewer Watchmen
From MaRDI portal
Publication:3315525
DOI10.1137/0604020zbMath0533.05021OpenAlexW1998193049WikidataQ56504468 ScholiaQ56504468MaRDI QIDQ3315525
Daniel J. Kleitman, Maria M. Klawe, Jeffry Kahn
Publication date: 1983
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0604020
Coloring of graphs and hypergraphs (05C15) Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial aspects of packing and covering (05B40)
Related Items (51)
Orthogonal polygon reconstruction from stabbing information ⋮ Edge guards for polyhedra in three-space ⋮ On gallery watchmen in grids ⋮ The prison yard problem ⋮ A Short Proof of the Rectilinear Art Gallery Theorem ⋮ Translating polygons with applications to hidden surface removal ⋮ Two-floodlight illumination of convex polygons ⋮ Quadrangulations of planar sets ⋮ Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem ⋮ Vertex Guarding for Dynamic Orthogonal Art Galleries ⋮ Algorithms for art gallery illumination ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ Generalized guarding and partitioning for rectilinear polygons ⋮ Hiding people in polygons ⋮ Converting triangulations to quadrangulations ⋮ Minimum r-Star Cover of Class-3 Orthogonal Polygons ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ Minimizing visible edges in polyhedra ⋮ The dispersive art gallery problem ⋮ On \(r\)-guarding SCOTs -- a new family of orthogonal polygons ⋮ On Some City Guarding Problems ⋮ Guarding Art Galleries: The Extra Cost for Sculptures Is Linear ⋮ Improved Bounds for Wireless Localization ⋮ Combinatorics and complexity of guarding polygons with edge and point 2-transmitters ⋮ Art gallery theorems for guarded guards. ⋮ ENERGY-AWARE STAGE ILLUMINATION ⋮ Minimum k-partitioning of rectilinear polygons ⋮ On Guarding Orthogonal Polygons with Sliding Cameras ⋮ Mobile versus point guards ⋮ Guarding curvilinear art galleries with vertex or point guards ⋮ The orthogonal art gallery theorem with constrained guards ⋮ On covering orthogonal polygons with star-shaped polygons ⋮ An exact algorithm for minimizing vertex guards on art galleries ⋮ A note on the contractions for orthogonal polygons ⋮ Perfect graphs and guarding rectilinear art galleries ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Improved bounds for wireless localization ⋮ A simple proof of the rectilinear art gallery theorem ⋮ The art gallery theorem for polyominoes ⋮ Orthogonal art galleries with interior walls ⋮ An ``Art Gallery Theorem for pyramids ⋮ New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision ⋮ Edge guards in rectilinear polygons ⋮ On separating two simple polygons by a single translation ⋮ Tight bounds for beacon-based coverage in simple rectilinear polygons ⋮ An alternative proof of the rectilinear art gallery theorem ⋮ On partitioning rectilinear polygons into star-shaped polygons ⋮ Illumination of Orthogonal Polygons with Orthogonal Floodlights ⋮ How to guard orthogonal polygons: diagonal graphs and vertex covers ⋮ Approximability of guarding weak visibility polygons
Cites Work
This page was built for publication: Traditional Galleries Require Fewer Watchmen
