Algorithms for art gallery illumination

DOI10.1007/s10898-016-0452-2zbMath1367.65028arXiv1410.5952OpenAlexW1889620494WikidataQ59529122 ScholiaQ59529122MaRDI QIDQ2397430

Christiane Schmidt, Michael Hemmer, Alexander Kröller, Maximilian Ernestus, Jan Kokemüller, Stephan Friedrichs, Mahdi Moeini

Publication date: 22 May 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.5952

zbMATH Keywords

numerical exampleslinear programcomputational geometrynonlinear programart gallery problemfadingLipschitz functionalgorithm engineering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)

Related Items

On Voronoi visibility maps of 1.5D terrains with multiple viewpoints

Uses Software

• CGAL
• Global Optimization Toolbox For Maple
• CPLEX

Cites Work

• Facets for art gallery problems
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Art gallery problem with guards whose range of vision is \(180^{\circ}\)
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• Traditional Galleries Require Fewer Watchmen
• ENERGY-AWARE STAGE ILLUMINATION
• Computational complexity of art gallery problems
• An exact algorithm for minimizing vertex guards on art galleries
• A Novel Efficient Approach for Solving the Art Gallery Problem
• The computational geometry algorithms library CGAL
• Algorithm 966
• Exact solutions and bounds for general art gallery problems
• Inapproximability results for guarding polygons and terrains