On the rectilinear art gallery problem. Algorithmic aspects
From MaRDI portal
Recommendations
Cited in
(15)- An efficient algorithm for guard placement in polygons with holes
- Generalized guarding and partitioning for rectilinear polygons
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- A Short Proof of the Rectilinear Art Gallery Theorem
- On the rectilinear art gallery problem
- Art Gallery Problems for Convex Nested Polygons
- Maximizing the guarded boundary of an art gallery is APX-complete
- A coloring algorithm for finding connected guards in art galleries
- Tight bounds for the rectangular art gallery problem
- A Novel Efficient Approach for Solving the Art Gallery Problem
- scientific article; zbMATH DE number 7616119 (Why is no real title available?)
- Exact Solutions and Bounds for General Art Gallery Problems
- A nearly optimal algorithm for covering the interior of an art gallery
- Facets for art gallery problems
This page was built for publication: On the rectilinear art gallery problem. Algorithmic aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028119)