Item
FernÃ¡ndez, Eduardo
Besuievsky, Gonzalo 

2014  
The radiosity problem can be expressed as a linear system, where the light transport interactions of all patches of the scene are considered. Due to the amount of computation required to solve the system, the whole matrix is rarely computed and iterative methods are used instead. In this paper we introduce a new algorithm to obtain an approximation of the radiosity inverse matrix. The method is based on the calculation of a random sample of rows of the form factor matrix. The availability of this matrix allows us to reduce the radiosity calculation costs, speeding up the radiosity process. This is useful in applications where the radiosity equation must be solved thousands of times for different light configurations. We apply it to solve inverse lighting problems, in scenes up to 170 K patches. The optimization process used finds optimal solutions in nearly interactive times, which improves on previous work This work was partially funded by the TIN201020590C0202 project from ministerio de ciencia e innovacion, Spain, and by Programa de Desarrollo de las Ciencias Basicas, Uruguay 

application/pdf  
00978493  
http://hdl.handle.net/10256/11977  
eng  
Elsevier  
MICINN/PN 20112013/TIN201020590C0202 ReproducciÃ³ digital del document publicat a: http://dx.doi.org/10.1016/j.cag.2014.02.001 Articles publicats (DIMA) 

Â© Computers and Graphics, 2014, vol. 41, p. 112  
Tots els drets reservats  
Infografia
Computer graphics Algorismes Algorithms 

A samplebased method for computing the radiosity inverse matrix  
info:eurepo/semantics/article  
DUGiDocs 