A nearly optimal sensor placement algorithm for boundary coverage
From MaRDI portal
Publication:941574
Recommendations
- A nearly optimal algorithm for covering the interior of an art gallery
- A randomized art-gallery algorithm for sensor placement
- Locating guards for visibility coverage of polygons
- Locating guards for visibility coverage of polygons
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
Cites work
- A fast algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- An efficient algorithm for guard placement in polygons with holes
- An exact algorithm for the maximum clique problem
- An optimal algorithm for detecting weak visibility of a polygon
- Covering Polygons Is Hard
- Guarding galleries and terrains
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- Inapproximability results for guarding polygons and terrains
- Locating guards for visibility coverage of polygons
- Some NP-hard polygon decomposition problems
Cited in
(8)- Polygon exploration with time-discrete vision
- A heuristic algorithm for minimax sensor location in the plane
- Optimal Sensor Placement Under Budgetary Constraints
- Towards optimal positioning of surveillance UGVs
- A randomized art-gallery algorithm for sensor placement
- A nearly optimal algorithm for covering the interior of an art gallery
- A practical algorithm with performance guarantees for the art gallery problem
- A practical algorithm with performance guarantees for the art gallery problem
This page was built for publication: A nearly optimal sensor placement algorithm for boundary coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941574)
