Skip to main content

An efficient cluster-based hierarchical progressive radiosity algorithm

  • Session CG2a — Image Synthesis
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1024))

Abstract

This paper describes a cluster-based hierarchical approach to energy transfer within the framework of a progressive radiosity algorithm. The clustering does not rely on the input geometry, but is performed on the basis of a local position in the scene for a pre-meshed scene model. The locality of the resulting clusters improves the accuracy of form factor calculations, and increases the number of possible high-level energy transfers between clusters within the imposed error bound. Limited refinement of the hierarchy of light interactions is supported without compromising the quality of shading when intermediate images are produced immediately upon user request. The algorithm performs well for complex scenes, and the growth of required data structures is linear with geometric complexity. The results of the experimental validation of the algorithm against measured real-world data show that calculation speed is reasonably traded for accuracy.

The authors would like to thank Oleg Okunev and Michael Cohen for reviewing the manuscript, as well as Koji Tsuchiya for help in collecting data describing the atrium and rendering of the Hurva Synagogue. Special thanks for helpful discussions and providing the measurement data go to Akira Fujimoto.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Daniel R. Baum, Holly E. Rushmeier, and James M. Winget. Improving radiosity solutions through the use of analytically determined form-factors. In Computer Graphics (SIGGRAPH'89 Proceedings), volume 23, pages 325–334, July 1989.

    Google Scholar 

  2. Michael Cohen, Shenchang Eric Chen, John R. Wallace, and Donald P. Greenberg. A progressive refinement approach to fast radiosity image generation. In Computer Graphics (SIGGRAPH'88 Proceedings), volume 22, pages 75–84, August 1988.

    Google Scholar 

  3. David W. George, Francois X. Sillion, and Donald P. Greenberg. Radiosity redistribution for dynamic environments. IEEE CG&A, 10(4):26–34, July 1990.

    Google Scholar 

  4. Pat Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. In Computer Graphics (SIGGRAPH '91 Proceedings), volume 25, pages 197–206, July 1991.

    Google Scholar 

  5. Nicolas Holzschuch, Francois Sillion, and George Dretakkis. An efficient progressive refinement strategy for hierarchical radiosity. In Fifth Eurographics Workshop on Rendering, pages 343–357, Darmstadt, Germany, June 1994.

    Google Scholar 

  6. A. Kok. Grouping of patches in progressive radiosity. Fourth Eurographics Workshop on Rendering (Paris, France), pages 221–232, June 1993.

    Google Scholar 

  7. D. Lischinski, F. Tampieri, and D. P. Greenberg. Combining hierarchical radiosity and discontinuity meshing. Computer Graphics (SIGGRAPH'93 Proceedings), 27:199–208, August 1993.

    Google Scholar 

  8. Gary W. Meyer, Holly E. Rushmeier, Michael F. Cohen, Donald P. Greenberg, and Kenneth E. Torrance. An experimental evaluation of computer graphics imagery. ACM Transactions on Graphics, 5(1):30–50, January 1986.

    Google Scholar 

  9. Karol Myszkowski and Tosiyasu L. Kunii. Texture mapping as an alternative for meshing during walkthrough animation. In Fifth Eurographics Workshop on Rendering, pages 375–388, Darmstadt, Germany, June 1994.

    Google Scholar 

  10. Holly Rushmeier, Aravindan Veerasamy, and Charles Patterson. Geometric simplification for indirect illumination calculations. In Proceedings of Graphics Interface '93, pages 227–236, Toronto, Ontario, Canada, May 1993.

    Google Scholar 

  11. Francois Sillion. Clustering and volume scattering for hierarchical radiosity calculations. In Fifth Eurographics Workshop on Rendering, pages 105–117, Darmstadt, Germany, June 1994.

    Google Scholar 

  12. Brian Smits, James Arvo, and Donald Greenberg. A clustering algorithm for radiosity in complex environments. In SIGGRAPH'94 Proceedings, Computer Graphics Proceedings, Annual Conference Series, pages 435–442, July 1994.

    Google Scholar 

  13. Brian E. Smits, James R. Arvo, and David H. Salesin. An importance-driven radiosity algorithm. In Computer Graphics (SIGGRAPH'92 Proceedings), volume 26, pages 273–282, July 1992.

    Google Scholar 

  14. Seth Teller, Celeste Fowler, Thomas Funkhouser, and Pat Hanrahan. Partitioning and ordering large radiosity computations. In SIGGRAPH'94 Proceedings, Annual Conference Series, pages 443–450, July 1994.

    Google Scholar 

  15. C. P. Verbeck and D. P. Greenberg. A comprehensive light-source description for computer graphics. IEEE CG&A, 4(7):66–75, July 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Roland T. Chin Horace H. S. Ip Avi C. Naiman Ting-Chuen Pong

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Myszkowski, K., Kunii, T.L. (1995). An efficient cluster-based hierarchical progressive radiosity algorithm. In: Chin, R.T., Ip, H.H.S., Naiman, A.C., Pong, TC. (eds) Image Analysis Applications and Computer Graphics. ICSC 1995. Lecture Notes in Computer Science, vol 1024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60697-1_114

Download citation

  • DOI: https://doi.org/10.1007/3-540-60697-1_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60697-0

  • Online ISBN: 978-3-540-49298-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics