Radiosity and realistic image synthesis
Radiosity and realistic image synthesis
Radioptimization: goal based rendering
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Sequential Monte Carlo techniques for the solution of linear systems
Journal of Scientific Computing
Design galleries: a general approach to setting parameters for computer graphics and animation
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Maximum entropy light source placement
Proceedings of the conference on Visualization '02
Inverse Direct Lighting with a Monte Carlo Method and Declarative Modelling
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Reuse of Paths in Light Source Animation
CGI '04 Proceedings of the Computer Graphics International
ACM Transactions on Graphics (TOG)
Technical Section: Efficient reuse of paths for random walk radiosity
Computers and Graphics
Lighting-by-Example with Wavelets
SG '07 Proceedings of the 8th international symposium on Smart Graphics
Optimal design of plant lighting system by genetic algorithms
Engineering Applications of Artificial Intelligence
Energy-saving light positioning using heuristic search
Engineering Applications of Artificial Intelligence
Incremental reuse of paths in random walk radiosity
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
| Hi-index | 0.00 |
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.