A nearly optimal sensor placement algorithm for boundary coverage

DOI10.1016/j.patcog.2008.05.001zbMath1154.68480OpenAlexW2089328976MaRDI QIDQ941574

Andrea Bottino, Aldo Laurentini

Publication date: 1 September 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.05.001

zbMATH Keywords

surveillanceinspectionvisibilityart galleryedge coveringvisual sensor positioning

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Related Items (2)

A nearly optimal algorithm for covering the interior of an art gallery ⋮ Polygon exploration with time-discrete vision

Cites Work

• Unnamed Item
• Unnamed Item
• Guarding galleries and terrains
• An exact 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
• A fast algorithm for the maximum clique problem
• LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
• Some NP-hard polygon decomposition problems
• Covering Polygons Is Hard
• An optimal algorithm for detecting weak visibility of a polygon
• Inapproximability results for guarding polygons and terrains

This page was built for publication: A nearly optimal sensor placement algorithm for boundary coverage