Dynamic Radiosity

In this paper we propose a novel radiosity implementation which we called dynamic radiosity. By storing and updating local form-factor matrix of the patches closest to the observer we have solved 2 main problems of radiosity algorithm: (1) quadratic complexity of the algorithm and thus difficulty of applying it to a large-scale scenes, and (2) the possibility of changing geometry on the fly (dynamic geometry)