A randomized art-gallery algorithm for sensor placement

DOI10.1145/378583.378674MaRDI QIDQ5361582zbMATH OpenOpenAlexFDO

Authors H.-H. González-Baños

Publication date 29 September 2017

Published in Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/378583.378674

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A nearly optimal algorithm for covering the interior of an art gallery
• A nearly optimal sensor placement algorithm for boundary coverage
• Polygon guarding with orientation
• Optimum placement of guards
• Visibility-based planning of sensor control strategies

Cited in

(14)

• Visibility-based planning of sensor control strategies
• Towards fully automated inspection of large components with UAVs: offline path planning and view angle dependent optimization strategies
• Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
• Robot task planning and explanation in open and uncertain worlds
• On guarding the vertices of rectilinear domains
• Discrete sensor placement problems in distribution networks
• Variational Gaussian process for optimal sensor placement.
• Universal guard problems
• Sequential sensor installation for Wiener disorder detection
• Towards optimal positioning of surveillance UGVs
• A multi-level optimization approach for the planning of heterogeneous sensor networks
• scientific article; zbMATH DE number 7662168 (Why is no real title available?)
• Guarding galleries and terrains
• A nearly optimal sensor placement algorithm for boundary coverage

This page was built for publication: A randomized art-gallery algorithm for sensor placement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361582)