An Empirical Comparison of Progressive and Wavelet Radiosity
This paper presents a comparison of basic progressive and wavelet radiosity algorithms. Several variants of each algorithm were run on a set of scenes at several parameter settings, and results were examined in terms of their error, speed, and memory consumption. We did not compare more advanced variations such as clustering or discontinuity meshing. Our results show that progressive radiosity with substructuring works fairly well for all scenes. Among wavelet methods, the Haar basis works best, while higher order methods suffer because of extreme memory consumption and because poor visibility handling causes discontinuous, blocky shadows.
KeywordsComputer Graphic Wavelet Method Complex Experiment Tube Experiment Progressive Method
Unable to display preview. Download preview PDF.
- Gladimir V. Baranoski, Randall Bramley, and Peter Shirley. Fast Radiosity Solutions for High Average Reflectance Environments. In Rendering Techniques ‘85 (Proceedings of the Sixth Eurographics Workshop on Rendering),pages 345–356. Springer-Verlag/Wien, 1995. (Technical report: http://swarm.cs.wustl.edu/~hart/mirror/indigna-bibio.html.)
- Simon Gibson and R. J. Hubbold. Efficient hierarchical refinement and clustering for radiosity in complex environments. Computer Graphics Forum, 15 (5): 297–310, December 1996.Google Scholar
- Peter Schröder. Numerical integration for radiosity in the presence of singularities. In Fourth Eurographics Workshop on Rendering, Paris, June 1993. http://www.cs.princeton.edu/gfx/papers/integration/.
- Peter Schröder and Pat Hanrahan. On the form factor between two polygons. In Computer Graphics (Proceed-ings of SIGGRAPH ‘83),pages 163–164, 1993. http://csvax.cs.caltech.edu/~ps/formfactor/ffpaper.ps.gz.
- Philipp Slusallek, Michael Schroder, Marc Stamminger, and Hans-Peter Seidel. Smart Links and Efficient Reconstruction for Wavelet Radiosity. In Rendering Techniques ‘85 (Proceedings of the Sixth Eurographics Workshop on Rendering), pages 240–251. Springer-Verlag/Wien, 1995. http://www9.informatik.uni-erlangen.de/eng/research/pub95/.Google Scholar
- Brian Smits, James Arvo, and Donald Greenberg. A clustering algorithm for radiosity in complex environments. In Proceedings ofSIGGRAPH ‘84 (Orlando, Florida, July 24–29, 1994),Computer Graphics Proceedings, Annual Conference Series, pages 435–442. ACM SIGGRAPH, ACM Press, July 1994. http://csvax.cs.caltech.edu/~arvo/papers.html.
- John R. Wallace, Kells A. Elmquist, and Eric A. Haines. A ray tracing algorithm for progressive radiosity. In Computer Graphics (SIGGRAPH ‘89 Proceedings), volume 23, pages 315–324, July 1989.Google Scholar
- Gregory J. Ward. The RADIANCE lighting simulation and rendering system. In SIGGRAPH 94 Proc., pages 459 - 472, July 1994. http://radsite.lbl.gov/radiance/papers/sg94.1/paper.html.Google Scholar
- Andrew J. Willmott and Paul S. Heckbert. An empirical comparison of radiosity algorithms. Technical Report CMU-CS-97–115, School of Computer Science, Carnegie Mellon University, April 1997. http://www.mpimet.mpg.de.
- Wei Xu and Donald S. Fussell. Constructing Solvers for Radiosity Equation Systems. Fifth Eurographics Workshop on Rendering, pages 207–217, June 1994.Google Scholar
- Harold R. Zatz. Galerkin radiosity: A higher-order solution method for global illumination. Computer Graphics (SIGGRAPH ‘83 Proceedings),August 1993. http://www.rhythm.com/~hzatz/.