Heuristic-Search-Based Light Positioning According to Irradiance Intervals

  • Francesc Castro
  • Esteve del Acebo
  • Mateu Sbert
Conference paper

DOI: 10.1007/978-3-642-02115-2_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5531)
Cite this paper as:
Castro F., del Acebo E., Sbert M. (2009) Heuristic-Search-Based Light Positioning According to Irradiance Intervals. In: Butz A., Fisher B., Christie M., Krüger A., Olivier P., Therón R. (eds) Smart Graphics. SG 2009. Lecture Notes in Computer Science, vol 5531. Springer, Berlin, Heidelberg

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.

Keywords

Light positioning heuristic search irradiance reuse of paths random walk 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Francesc Castro
    • 1
  • Esteve del Acebo
    • 1
  • Mateu Sbert
    • 1
  1. 1.Institut d’Informàtica i AplicacionsUniversitat de GironaSpain

Personalised recommendations