Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Energy-aware Stage Illumination

MPG-Autoren
/persons/resource/persons44373

Eisenbrand,  Friedrich
Discrete Optimization, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

Karrenbauer,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45000

Matijevic,  Domagoj
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PuRe verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Eisenbrand, F., Funke, S., Karrenbauer, A., & Matijevic, D. (2005). Energy-aware Stage Illumination. In Proceedings of the 21st Annual Symposium on Computational Geometry (pp. 336-346). New York, USA: ACM. doi:10.1145/1064092.1064144.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-000F-2666-7
Zusammenfassung
Consider the following illumination problem: given a stage represented by a line segment $\Stage$ 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. \cite{u-agip-00}) 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.