Optimum placement of guards
From MaRDI portal
Recommendations
Cites work
- A linear algorithm for computing the visibility polygon from a point
- Computational complexity of art gallery problems
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Path Planning in 0/1/∞ Weighted Regions with Applications
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
Cited in
(10)- An efficient algorithm for guard placement in polygons with holes
- Finding a guard that sees most and a shop that sells most
- Maximizing the guarded boundary of an Art Gallery is APX-complete
- Locating guards for visibility coverage of polygons
- Guard placement for maximizing L-visibility exterior to a convex polygon
- scientific article; zbMATH DE number 4062605 (Why is no real title available?)
- Locating guards for visibility coverage of polygons
- A randomized art-gallery algorithm for sensor placement
- scientific article; zbMATH DE number 6469255 (Why is no real title available?)
- Optimizing visibility-based search in polygonal domains
This page was built for publication: Optimum placement of guards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328566)
