000121634 001__ 121634
000121634 005__ 20190331192655.0
000121634 037__ $$aCONF
000121634 245__ $$aEnergy-aware stage illumination
000121634 269__ $$a2005
000121634 260__ $$c2005
000121634 336__ $$aConference Papers
000121634 520__ $$aConsider 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. Copyright 2005 ACM.
000121634 700__ $$0240331$$g183121$$aEisenbrand, Friedrich
000121634 700__ $$aKarrenbauer, Andreas
000121634 700__ $$aFunke, Stefan
000121634 700__ $$aMatijevic, Domagoj
000121634 773__ $$tProceedings of the Annual Symposium on Computational Geometry$$q336-345
000121634 8564_ $$uhttps://infoscience.epfl.ch/record/121634/files/file-121634.gz$$zn/a$$s6145
000121634 909C0 $$xU11879$$0252111$$pDISOPT
000121634 909CO $$qGLOBAL_SET$$pconf$$ooai:infoscience.tind.io:121634$$pSB
000121634 937__ $$aDISOPT-CONF-2005-006
000121634 970__ $$a06099732403/DISOPT
000121634 973__ $$sPUBLISHED$$aOTHER
000121634 980__ $$aCONF