Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02115-2_11 | Smart Graphics |
Keywords | Field | DocType |
maximum value,light positioning,emission power,different heuristic-search strategy,linear programming,good solution,heuristic-search-based light positioning,closed environment,global illumination radiosity solution,irradiance intervals,light position,minimum total emission power,global illumination,heuristic search,random walk,linear program,search space | Computer vision,Heuristic,Reuse,Random walk,Computer science,Irradiance,Artificial intelligence,Global illumination,Linear programming,Radiosity (computer graphics) | Conference |
Volume | ISSN | Citations |
5531 | 0302-9743 | 4 |
PageRank | References | Authors |
0.46 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesc Castro | 1 | 34 | 4.13 |
| Esteve del Acebo | 2 | 76 | 11.10 |
| Mateu Sbert | 3 | 1108 | 123.95 |