An alternative proof of the rectilinear art gallery theorem
From MaRDI portal
(Redirected from Publication:795339)
Recommendations
Cites work
Cited in
(24)- How to guard orthogonal polygons: diagonal graphs and vertex covers
- Hiding people in polygons
- Approximation algorithms for art gallery problems in polygons
- Approximability of guarding weak visibility polygons
- An ``Art Gallery Theorem for pyramids
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- Vertex guarding for dynamic orthogonal art galleries
- 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
- Guarding galleries and terrains
- scientific article; zbMATH DE number 7616119 (Why is no real title available?)
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards
- 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
- Edge guards in rectilinear polygons
- On the enumeration of permutominoes
- 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)