A nearly optimal algorithm for covering the interior of an art gallery

DOI10.1016/j.patcog.2010.11.010zbMath1209.68440OpenAlexW2079810056MaRDI QIDQ632590

Andrea Bottino, Aldo Laurentini

Publication date: 25 March 2011

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

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

zbMATH Keywords

art galleryinternal coveringvisual sensor positioning

Mathematics Subject Classification ID

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

Related Items

Algorithm 966

Cites Work

• Unnamed Item
• Unnamed Item
• Guarding galleries and terrains
• A nearly optimal sensor placement algorithm for boundary coverage
• An efficient algorithm for guard placement in polygons with holes
• LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
• Covering Polygons Is Hard
• Inapproximability results for guarding polygons and terrains

This page was built for publication: A nearly optimal algorithm for covering the interior of an art gallery