Abstract
Radiosity techniques produce highly realistic synthetic images for diffuse environments. Monte Carlo random walk approaches, widely applied to radiosity, have as a drawback the necessity of a high number of random paths to obtain an acceptable result, involving a high computation cost. The reuse of paths is a strategy to reduce this cost, allowing that a path distributes light power from several light positions, resulting in a noticeable speed-up factor.
We present a new strategy of reuse of paths, which will allow us, given a previously computed set of radiosity solutions corresponding to n light positions, to add new light positions and accurately compute the radiosity solution at a reduced cost by reusing paths. Our incremental strategy can be applied to light positioning in interior design, allowing the set of authorized light locations to be enriched by adding new positions chosen by the user.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bekaert, P.: Hierarchical and stochastic algorithms for radiosity. Ph.D. Thesis. Catholic Univ. of Leuven (1999)
Castro, F., Acebo, E., Sbert, M.: Heuristic-search-based light positioning according to irradiance intervals. In: Butz, A., Fisher, B., Christie, M., Krüger, A., Olivier, P., Therón, R. (eds.) SG 2009. LNCS, vol. 5531, pp. 128–139. Springer, Heidelberg (2009), http://ima.udg.edu/~castro/articles/SG09.pdf
Castro, F., Sbert, M., Halton, J.: Efficient reuse of paths for random walk radiosity. Computers and Graphics 32(1), 65–81 (2008)
Cohen, M., Wallace, J.: Radiosity and Realistic Image Synthesis. Academic Press Professional, London (1993)
Delepoulle, S., Renaud, C., Chelle, M.: Improving light position in a growth chamber through the use of a genetic algorithm. Artificial Intelligence Techniques for Computer Graphics 159, 67–82 (2008)
Elorza, J., Rudomin, I.: An interactive system for solving inverse illumination problems using genetic algorithms. Computation Visual (1997)
Halton, J.: Sequential Monte Carlo techniques for the solution of linear systems. Journal of Scientific Computing 9(2), 213–257 (1994)
Pattanaik, S., Mudur, S.: Computation of global illumination by Monte Carlo simulation of the particle model of light. In: Proceedings of third Eurographics WorkShop on Rendering, pp. 71–83. Springer, Heidelberg (1992)
Sbert, M.: The use of global random directions to compute radiosity. Global Monte Carlo methods. Ph.D. Thesis. Univ. Politècnica de Catalunya (1997)
Sbert, M., Bekaert, P., Halton, J.: Reusing paths in radiosity and global illumination. In: Proceedings of 4th IMACS Seminar on Monte Carlo Methods, Berlin, Germany, vol. 10(3-4), pp. 575–585 (2004)
Sbert, M., Castro, F., Halton, J.: Reuse of paths in light source animation. In: Proceedings of CGI 2004, Crete (Greece), pp. 532–535. IEEE Computer Society Press, Los Alamitos (2004)
Sbert, M., Szecsi, L., Szirmay-Kalos, L.: Real-time light animation. In: Computer Graphics Forum (proc. EG 2004), vol. 23(3), pp. 291–299 (2004)
Veach, E.: Robust Monte Carlo methods for light transport simulation. Ph.D. Thesis. Stanford University (1997)
Veach, E., Guibas, L.: Optimally combining sampling techniques for monte carlo rendering. In: ACM SIGGRAPH 1995 proceedings, pp. 419–428. Addison Wesley Publishing Company, Reading (1995)
Wald, I., Kollig, T., Benthin, C., Keller, A., Slussalek, P.: Interactive global illumination using fast ray tracing. In: Rendering Techniques 2002. ACM International Conference Proceeding Series, vol. 28, pp. 15–24. Eurographics Association (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, F., Sbert, M. (2010). Incremental Reuse of Paths in Random Walk Radiosity. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2009. Lecture Notes in Computer Science, vol 5910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12535-5_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-12535-5_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12534-8
Online ISBN: 978-3-642-12535-5
eBook Packages: Computer ScienceComputer Science (R0)