Title
Energy-aware stage illumination
Abstract
Consider the following illumination problem: given a stage represented by a line segment L and a set of lightsources represented by a set of points S in the plane, assign powers to the lightsources such that every point on the stage receives a sufficient amount -- let's say one unit -- of light while minimizing the overall power consumption. By assuming that the amount of light arriving from a fixed lightsource decreases rapidly with the distance from the lightsource, this becomes an interesting optimization problem.We propose to reconsider the classical illumination problems as known from computational geometry literature (e.g. [12]) under this light attenuation model. This paper examines the simple problem introduced above and presents different solutions, based on convex optimization, discretization and linear programming, as well as a purely combinatorial approximation algorithm. Some experimental results are also provided.
Year
DOI
Venue
2008
10.1145/1064092.1064144
Symposium on Computational Geometry
Keywords
Field
DocType
energy-aware stage illumination,interesting optimization problem,illumination problem,sufficient amount,light attenuation model,following illumination problem,optimization,fixed lightsource,computational geometry literature,simple problem,convex optimization,classical illumination problem,combinatorial approximation algorithm,art gallery problems,optimization problem,computational geometry,art gallery problem,linear program
Approximation algorithm,Line segment,Discretization,Combinatorics,Computer science,Computational geometry,Illumination problem,Algorithm,Linear programming,Optimization problem,Convex optimization
Journal
Volume
Issue
ISSN
18
1/2
0218-1959
ISBN
Citations 
PageRank 
1-58113-991-8
0
0.34
References 
Authors
8
4
Name
Order
Citations
PageRank
Friedrich Eisenbrand172653.74
stefan funke270657.45
Andreas Karrenbauer313320.21
Domagoj Matijevic4668.09