Traditional Galleries Require Fewer Watchmen
From MaRDI portal
Recommendations
- A simple proof of the rectilinear art gallery theorem
- scientific article; zbMATH DE number 1424310
- Watched guards in art galleries
- scientific article; zbMATH DE number 2163102
- scientific article; zbMATH DE number 2040955
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Art galleries with interior walls
- A Short Proof of the Rectilinear Art Gallery Theorem
- Orthogonal art galleries with interior walls
- The smallest art gallery not guarded by every third vertex
Cited in
(64)- On gallery watchmen in grids
- Hiding people in polygons
- On covering orthogonal polygons with star-shaped polygons
- Edge guards in rectilinear polygons
- Guarding rectangular art galleries
- The prison yard problem
- Converting triangulations to quadrangulations
- Characterizing and efficiently computing quadrangulations of planar point sets
- Art gallery theorems for guarded guards.
- Orthogonal polygon reconstruction from stabbing information
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Mobile versus point guards
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- On separating two simple polygons by a single translation
- Generalized guarding and partitioning for rectilinear polygons
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
- Edge guards for polyhedra in three-space
- Perfect graphs and guarding rectilinear art galleries
- Tight bounds for beacon-based coverage in simple rectilinear polygons
- Approximability of guarding weak visibility polygons
- Algorithms for art gallery illumination
- Guarding orthogonal art galleries with sliding cameras
- Watched guards in art galleries
- Orthogonal art galleries with interior walls
- How to guard orthogonal polygons: diagonal graphs and vertex covers
- Minimum \(r\)-star cover of class-3 orthogonal polygons
- On guarding orthogonal polygons with sliding cameras
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
- On Some City Guarding Problems
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Improved Bounds for Wireless Localization
- ENERGY-AWARE STAGE ILLUMINATION
- A Short Proof of the Rectilinear Art Gallery Theorem
- scientific article; zbMATH DE number 59108 (Why is no real title available?)
- scientific article; zbMATH DE number 177851 (Why is no real title available?)
- Illumination of Orthogonal Polygons with Orthogonal Floodlights
- Irrational guards are sometimes needed
- An exact algorithm for minimizing vertex guards on art galleries
- Translating polygons with applications to hidden surface removal
- Two-floodlight illumination of convex polygons
- Quadrangulations of planar sets
- Vertex guarding for dynamic orthogonal art galleries
- The orthogonal art gallery theorem with constrained guards
- A simple proof of the rectilinear art gallery theorem
- An addition to art galleries with interior walls
- Minimizing visible edges in polyhedra
- The dispersive art gallery problem
- On \(r\)-guarding SCOTs -- a new family of orthogonal polygons
- Illumination with orthogonal floodlights
- No quadrangulation is extremely odd
- On half guarding polygons
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards
- A note on the contractions for orthogonal polygons
- A proportion of visibility polygon's surface to the entire polygon's surface: a lower bound of the proportion derived for general polygons of any shape and orthogonal polygons
- The art gallery theorem for polyominoes
- Polynomial-time algorithms for contiguous art gallery and related problems
- An alternative proof of the rectilinear art gallery theorem
- On partitioning rectilinear polygons into star-shaped polygons
- Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem
- Minimum k-partitioning of rectilinear polygons
- Guarding curvilinear art galleries with vertex or point guards
- Approximation algorithms for art gallery problems in polygons
- Improved bounds for wireless localization
- An ``Art Gallery Theorem for pyramids
This page was built for publication: Traditional Galleries Require Fewer Watchmen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315525)
