A nearly optimal algorithm for covering the interior of an art gallery
From MaRDI portal
Publication:632590
DOI10.1016/J.PATCOG.2010.11.010zbMATH Open1209.68440OpenAlexW2079810056MaRDI QIDQ632590FDOQ632590
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
Recommendations
- An approximation algorithm for the art gallery problem
- Approximation algorithms for art gallery problems in polygons
- scientific article
- Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
- A Novel Efficient Approach for Solving the Art Gallery Problem
- scientific article; zbMATH DE number 219237
- Exact solutions and bounds for general art gallery problems
- Exact Solutions and Bounds for General Art Gallery Problems
- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient algorithm for guard placement in polygons with holes
- Guarding galleries and terrains
- Covering Polygons Is Hard
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
- Inapproximability results for guarding polygons and terrains
- A nearly optimal sensor placement algorithm for boundary coverage
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A practical algorithm with performance guarantees for the art gallery problem
- Towards optimal positioning of surveillance UGVs
- A Novel Efficient Approach for Solving the Art Gallery Problem
- Title not available (Why is that?)
- Algorithm 966
This page was built for publication: A nearly optimal algorithm for covering the interior of an art gallery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632590)
