Fast Radiosity Solutions For Environments With High Average Reflectance
In radiosity algorithms the average radiance of n Lambertian patches is approximated by solving a linear system with n unknowns. When n is small (i.e. fewer than thousands of patches), general matrix methods like Gauss-Siedel can be used where the explicit n × n matrix can be precomputed and stored . When n is large, progressive techniques are used where the matrix rows or elements are recomputed as needed . When n is very large (i.e. hundreds of thousands of patches), stochastic techniques can avoid computing or storing the n 2 elements of the matrix .
KeywordsChebyshev Polynomial Iteration Matrix Chebyshev Method Innermost Loop Progressive Technique
Unable to display preview. Download preview PDF.
- 1.G. V. Baranoski, R. Bramley, and P. Shirley, Iterative methods for fast radiosity solutions, tech. rep., Indiana University, 1995.Google Scholar
- 2.R. Barrett, etal., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1 ed., 1994.Google Scholar
- 6.M. Feda, and W. Purgathofer, Accelerating radiosity by overshooting, in Proc. of the Third Eurographics Rendering Workshop, Consolidation Express, June 1992, pp. 21–32.Google Scholar
- 10.L. Neumann, New efficient algorithms with positive definite radiosity matrix, in Proc. of the Fifth Eurographics Rendering Workshop, June 1994, pp. 219–237.Google Scholar
- 12.E. Stiefel, Kernel polynomials in linear algebra and their numerical application, in Further Contributions to the Solutions of Simultaneous Linear Equations and the Determination of Eigenvalues, National Bureau of Standards, Applied Mathematical Series - 49, 1958.Google Scholar