Energy-Aware Stage Illumination
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
EISENBRAND, Friedrich, Stefan FUNKE, Andreas KARRENBAUER, Domagoj MATIJEVIC, 2008. Energy-Aware Stage Illumination. 21th annual symposium on Computational geometry. Pisa, 2005. In: International Journal of Computational Geometry & Applications. 2008, 18(01n02), pp. 107-129. ISSN 0218-1959. Available under: doi: 10.1142/S0218195908002556BibTex
@article{Eisenbrand2008Energ-6172, year={2008}, doi={10.1142/S0218195908002556}, title={Energy-Aware Stage Illumination}, number={01n02}, volume={18}, issn={0218-1959}, journal={International Journal of Computational Geometry & Applications}, pages={107--129}, author={Eisenbrand, Friedrich and Funke, Stefan and Karrenbauer, Andreas and Matijevic, Domagoj}, note={Also publ. in: International Journal of Computational Geometry and Applications ; 18 (2008), 1/2. - pp. 107-129} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6172"> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 21th annual symposium on Computational geometry, Pisa, 2005, pp. 336-345</dcterms:bibliographicCitation> <dc:rights>terms-of-use</dc:rights> <dc:creator>Eisenbrand, Friedrich</dc:creator> <dcterms:title>Energy-Aware Stage Illumination</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6172/1/Energy_Aware_Stage_Illumination.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6172"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:57Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Matijevic, Domagoj</dc:creator> <dc:contributor>Eisenbrand, Friedrich</dc:contributor> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dc:creator>Funke, Stefan</dc:creator> <dcterms:issued>2008</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Matijevic, Domagoj</dc:contributor> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:language>eng</dc:language> <dc:contributor>Karrenbauer, Andreas</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6172/1/Energy_Aware_Stage_Illumination.pdf"/> <dc:contributor>Funke, Stefan</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:57Z</dcterms:available> <dc:format>application/pdf</dc:format> <dc:creator>Karrenbauer, Andreas</dc:creator> </rdf:Description> </rdf:RDF>