International audienceCombining animation and global illumination constitutes, at present, a true challenge in 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 can efficiently manage any moving surface -even light source- to compute animation sequences. For each new frame of a sequence, we take into account the continuous property of the moves 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 an efficient and simple algorithm, similar to the classical progressive refinement algorithm, and which computes animated sequence about three times faster
