The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

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.

Notes

Number of pages: 12

Text Reference

Andrew Willmott and Paul Heckbert, "An Empirical Comparison of Progressive and Wavelet Radiosity," Eurographics Workshop on Rendering, June, 1997.

BibTeX Reference

@inproceedings{Willmott_1997_2925,
   author = "Andrew Willmott and Paul Heckbert",
   title = "An Empirical Comparison of Progressive and Wavelet Radiosity",
   booktitle = "Eurographics Workshop on Rendering",
   month = "June",
   year = "1997",
}

The Robotics Institute

Menu