Locating guards for visibility coverage of polygons
From MaRDI portal
Recommendations
Cites work
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- An optimal visibility graph algorithm for triangulated simple polygons
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Computational complexity of art gallery problems
- Corrections to Lee's visibility polygon algorithm
- Decomposing a Polygon into Simpler Components
- Guarding galleries and terrains
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
Cited in
(20)- Optimum placement of guards
- Altitude terrain guarding and guarding uni-monotone polygons
- Covering grids and orthogonal polygons with periscope guards
- Finding a guard that sees most and a shop that sells most
- Blocking visibility for points in general position
- Guarding orthogonal art galleries with sliding cameras
- Universal guard problems
- Guard placement for maximizing L-visibility exterior to a convex polygon
- Minimum covering with travel cost
- Locating guards for visibility coverage of polygons
- Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
- Searching a Polygonal Region by Two Guards
- A nearly optimal algorithm for covering the interior of an art gallery
- A practical algorithm with performance guarantees for the art gallery problem
- Robustly guarding polygons
- The art gallery theorem for polyominoes
- A practical algorithm with performance guarantees for the art gallery problem
- Polynomial-time algorithms for contiguous art gallery and related problems
- Facets for art gallery problems
- A nearly optimal sensor placement algorithm for boundary coverage
This page was built for publication: Locating guards for visibility coverage of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3063659)
