Heuristic-search-based light positioning according to irradiance intervals

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a strategy to solve the problem of light positioning in a closed environment. We aim at obtaining, for a global illumination radiosity solution, the position and emission power for a given number of lights that provide a desired illumination at a minimum total emission power. Such a desired illumination is expressed using minimum and/or maximum values of irradiance allowed. A pre-process is needed in which irradiance is computed for a pre-established set of light positions by means of a random walk. The reuse of paths makes this pre-process reasonably cheap. Different heuristic-search strategies are explored and compared in our work, which, combined to linear programming, make it possible to efficiently visit the search space and, in most cases, obtain a good solution at a reasonable cost. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Castro, F., Del Acebo, E., & Sbert, M. (2009). Heuristic-search-based light positioning according to irradiance intervals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5531 LNCS, pp. 128–139). https://doi.org/10.1007/978-3-642-02115-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free