An Empirical Comparison of Progressive and Wavelet Radiosity

  • Andrew J. Willmott
  • Paul S. Heckbert
Part of the Eurographics book series (EUROGRAPH)


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.


Computer Graphic Wavelet Method Complex Experiment Tube Experiment Progressive Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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:
  2. [2]
    Michael Cohen, Donald P. Greenberg, Dave S. Immel, and Philip J. Brock. An efficient radiosity approach for realistic image synthesis. IEEE Computer Graphics and Applications, 6 (3): 26–35, March 1986.CrossRefGoogle Scholar
  3. [3]
    Michael E Cohen, Shenchang Eric Chen, John R. Wallace, and Donald P. Greenberg. A progressive refinement approach to fast radiosity image generation. Computer Graphics (SIGGRAPH ‘88 Proceedings), 22 (4): 75–84, Aug. 1988.CrossRefGoogle Scholar
  4. [4]
    Michael F. Cohen and John R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press, Boston, 1993.MATHGoogle Scholar
  5. [5]
    Reid Gershbein, Peter Schröder, and Pat Hanrahan. Textures and radiosity: Controlling emission and reflection with texture maps. In Computer Graphics (Proceedings of SIGGRAPH ‘84), pages 51 - 58, July 1994. Scholar
  6. [6]
    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
  7. [7]
    Steven J. Gortler, Michael F. Cohen, and Phillipp Slusallek. Radiosity and Relaxation Methods. IEEE Computer Graphics and Applications, 14 (6): 48 - 58, November 1994. Scholar
  8. [8]
    Steven J. Gortler, Peter Schröder, Michael E Cohen, and Pat Hanrahan. Wavelet radiosity. Computer Graphics (SIGGRAPH ‘83 Proceedings), August 1993. Scholar
  9. [9]
    Pat Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics (SIGGRAPH ‘81 Proceedings), 25 (4): 197 - 206, July 1991. Scholar
  10. [10]
    Holly Rushmeier, Greg Ward, Christine Piatko, Phil Sanders, and Bert Rust. Comparing real and synthetic images: Some ideas about metrics. In Rendering Techniques ‘85, pages 82–91. Springer-Verlag/Wien, 1995. Scholar
  11. [11]
    Peter Schröder. Numerical integration for radiosity in the presence of singularities. In Fourth Eurographics Workshop on Rendering, Paris, June 1993.
  12. [12]
    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.
  13. [13]
    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. Scholar
  14. [14]
    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.
  15. [15]
    Eric J. Stollnitz, Tony D. DeRose, and David H. Salesin. Wavelets for Computer Graphics. Morgan Kaufmann Publishers, San Francisco, CA, 1996. Scholar
  16. [16]
    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
  17. [17]
    Gregory J. Ward. The RADIANCE lighting simulation and rendering system. In SIGGRAPH 94 Proc., pages 459 - 472, July 1994. Scholar
  18. [18]
    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.
  19. [19]
    Wei Xu and Donald S. Fussell. Constructing Solvers for Radiosity Equation Systems. Fifth Eurographics Workshop on Rendering, pages 207–217, June 1994.Google Scholar
  20. [20]
    Harold R. Zatz. Galerkin radiosity: A higher-order solution method for global illumination. Computer Graphics (SIGGRAPH ‘83 Proceedings),August 1993.

Copyright information

© Springer-Verlag/Wien 1997

Authors and Affiliations

  • Andrew J. Willmott
    • 1
  • Paul S. Heckbert
    • 1
  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations