Advertisement

An efficient cluster-based hierarchical progressive radiosity algorithm

  • Karol Myszkowski
  • Tosiyasu L. Kunii
Session CG2a — Image Synthesis
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Initial Mesh Complex Scene Global Illumination Lighting Simulation Light Interaction 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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. 6.
    A. Kok. Grouping of patches in progressive radiosity. Fourth Eurographics Workshop on Rendering (Paris, France), pages 221–232, June 1993.Google Scholar
  7. 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. 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. 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. 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. 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. 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. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Karol Myszkowski
    • 1
  • Tosiyasu L. Kunii
    • 1
  1. 1.The University of AizuAizu-WakamatsuJapan

Personalised recommendations