A new mathematical development for radiosity animation with Galerkin method
A. Didier, B. Venceslas, M. Sylvain · 2002
Combining animation and global illumination constitutes a real challenge it? computer graphics, especially when light sources move in a complex scene because the entire illumination has to be recomputed. This paper introduces a new algorithm, based on the Galerkin method, which efficiently computes an animation sequence with any moving surface-even a light source. For each new frame, we take into account the continuous property of the movement to determine the necessary energy differences between the previous global illumination solution and the new one. Based on a mathematical development of the form factor, this new approach leads to all efficient and simple algorithm, similar to the classical progressive refinement algorithm, and which computes an animated sequence about three times faster.