Generalized guarding and partitioning for rectilinear polygons
From MaRDI portal
(Redirected from Publication:1917042)
Recommendations
Cites work
- A Short Proof of the Rectilinear Art Gallery Theorem
- An alternative proof of the rectilinear art gallery theorem
- An efficient algorithm for guard placement in polygons with holes
- Covering and guarding polygons using \(L_ k\)-sets
- Generalized guarding and partitioning for rectilinear polygons
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 139794 (Why is no real title available?)
- scientific article; zbMATH DE number 177553 (Why is no real title available?)
- scientific article; zbMATH DE number 177851 (Why is no real title available?)
- Traditional Galleries Require Fewer Watchmen
- Triangulating a simple polygon in linear time
Cited in
(14)- Edge guards in rectilinear polygons
- FO model checking on geometric graphs
- Mobile versus point guards
- Generalized guarding and partitioning for rectilinear polygons
- Tight bounds for beacon-based coverage in simple rectilinear polygons
- Approximate guarding of monotone and rectilinear polygons
- Covering and guarding polygons using \(L_ k\)-sets
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
- GUARDING RECTANGULAR PARTITIONS
- scientific article; zbMATH DE number 4060719 (Why is no real title available?)
- Triangulating and guarding realistic polygons
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- An alternative proof of the rectilinear art gallery theorem
- Approximation algorithms for art gallery problems in polygons
This page was built for publication: Generalized guarding and partitioning for rectilinear polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917042)
