Abstract
In this paper we extend our previous result on reusing shooting paths when dealing with moving light sources in radiosity to the final gathering step algorithm, which combines a shooting solution and a gathering step. Paths are reused for each frame in both shooting and gathering steps, obtaining a noticeable reduction of cost in the computation of the solutions for every frame. Moreover, the correlation between consecutive frames happens to be higher than in the case of independent solutions, resulting in a clear reduction of the temporal aliasing effects in the animation.
Chapter PDF
References
Bekaert, P.: Hierarchical and Stochastic Algorithms for Radiosity. Ph.D. thesis. Katholic Univ. of Leuven (1999)
Bekaert, P., Sbert, M., Halton, J.: Accelerating Path Tracing by Re-Using Paths. In: Proceedings of Workshop on Rendering, pp. 125–134 (2002)
Cohen, M., Wallace, J.: Radiosity and Realistic Image Synthesis. Academic Press Professional, Cambridge (1993)
Keller, A.: Instant Radiosity. In: Computer Graphics Proceedings, Siggraph 1997, pp. 49–56 (1997)
Perez, F.: Global Illumination Techniques for the Computation of High Quality Images in General Environments. Ph.D. thesis. Universitat Politècnica de Catalunya (2003)
Sbert, M., Castro, F., Halton, J.: Reuse of Paths in Light Source Animation. Computer Graphics International Proceedings (to appear as short paper) (2004)
Wann, H.: Jensen Global Illumination using Photon Maps. Rendering Techniques, 21–30 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sbert, M., Castro, F. (2004). Reuse of Paths in Final Gathering Step with Moving Light Sources. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25944-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-25944-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22129-6
Online ISBN: 978-3-540-25944-2
eBook Packages: Springer Book Archive