An efficient algorithm for guard placement in polygons with holes
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- Guarding disjoint triangles and claws in the plane
- An algorithm for polygon placement using a bottom-left strategy
- Multi-agent deployment for visibility coverage in polygonal environments with holes
- Approximation algorithms for art gallery problems in polygons
- Vertex guarding for dynamic orthogonal art galleries
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- An efficient algorithm for the three-guard problem
- Illumination in the presence of opaque line segments in the plane
- Optimum placement of guards
- The art gallery theorem for polyominoes
- Fast vertex guarding for polygons with and without holes
- A nearly optimal algorithm for covering the interior of an art gallery
- scientific article; zbMATH DE number 4060719 (Why is no real title available?)
- scientific article; zbMATH DE number 139794 (Why is no real title available?)
- Polygon guarding with orientation
- A nearly optimal sensor placement algorithm for boundary coverage
- Illuminating disjoint line segments in the plane
- Multiple-guard kernels of simple polygons
- Guard placement for efficient point-in-polygon proofs
- Edge guards in rectilinear polygons
- Generalized guarding and partitioning for rectilinear polygons
This page was built for publication: An efficient algorithm for guard placement in polygons with holes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346129)
