Algorithms for art gallery illumination

作者：Ernestus Maximilian; Friedrichs Stephan^*; Hemmer Michael; Kokemueller Jan; Kroeller Alexander; Moeini Mahdi; Schmidt Christiane

来源：Journal of Global Optimization, 2017, 68(1): 23-45.

DOI：10.1007/s10898-016-0452-2

• Art gallery problem
• Fading
• Computational geometry
• Linear program
• Non-linear program
• Lipschitz function
• Algorithm engineering

The art gallery problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a given polygon. The AGP is well-known to be NP-hard even in restricted cases. In this paper, we consider the AGP with fading (AGPF): A polygonal region is to be illuminated with light sources such that every point is illuminated with at least a global threshold, light intensity decreases over distance, and we seek to minimize the total energy consumption. Choosing fading exponents of zero, one, and two are equivalent to the AGP, laser scanner applications, and natural light, respectively. We present complexity results as well as a negative solvability result. Still, we propose two practical algorithms for AGPF with fixed light positions (e.g. vertex guards) independent of the fading exponent, which we demonstrate to work well in practice. One is based on a discrete approximation, the other on non-linear programming by means of simplex-partitioning strategies. The former approach yields a fully polynomial-time approximation scheme for the AGPF with fixed light positions. The latter approach obtains better results in our experimental evaluation.

• 出版日期2017-5