Exact solutions and bounds for general art gallery problems

DOI10.1145/2133803.2184449zbMath1284.05297OpenAlexW2023162661MaRDI QIDQ5406268

Tobias Baumgartner, Alexander Kröller, Sándor P. Fekete, Christiane Schmidt

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

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

zbMATH Keywords

geometrylinear programmingdualityvisibilityseparationart gallery problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Universal Guard Problems ⋮ Algorithms for art gallery illumination ⋮ Constrained Light Deployment for Reducing Energy Consumption in Buildings ⋮ Minimum covering with travel cost ⋮ Algorithm 966 ⋮ Facets for art gallery problems ⋮ Solving the natural wireless localization problem to optimality efficiently

Uses Software

• SoPlex
• 2D Arrangement

This page was built for publication: Exact solutions and bounds for general art gallery problems