Face Cluster Radiosity

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


An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolution modelling. A new face clustering technique for automatically partitioning polygonal models is used. The face clusters produced group adjacent triangles with similar normal vectors. They are used during radiosity solution to represent the light reflected by a complex object at multiple levels of detail. Also, the radiosity method is reformulated in terms of vector irradiance and power. Together, face clustering and the vector formulation of radiosity permit large savings. Excessively fine levels of detail are not accessed by the algorithm during the bulk of the solution phase, greatly reducing its memory requirements relative to previous methods. Consequently, the costliest steps in the simulation can be made sub-linear in scene complexity. Using this algorithm, radiosity simulations on scenes of one million input polygons can be computed on a standard workstation.


Complex Scene Global Illumination Power Vector Volume Cluster Edge Contraction 
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]
    James Arvo. The irradiance Jacobian for partially occluded polyhedral sources. In Proceedings of SIGGRAPH’ 94 (Orlando, Florida, July 24–29, 1994), Computer Graphics Proceedings, Annual Conference Series, pages 343–350. ACM SIGGRAPH, ACM Press, July 1994.Google Scholar
  2. [2]
    Per H. Christensen, Dani Lischinski, Eric J. Stollnitz, and David H. Salesin. Clustering for glossy global illumination. ACM Transactions on Graphics, 16(1):3–33, January 1997.CrossRefGoogle Scholar
  3. [3]
    Michael F. Cohen and John R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press Professional, Boston, MA, 1993.MATHGoogle Scholar
  4. [4]
    Michael Garland. Quadric-Based Polygonal Surface Simplification. PhD thesis (Technical Report CMU-CS-99-105), Carnegie Mellon University, 1999. http://www.cs.cmu.edu/~garland/thesis.Google Scholar
  5. [5]
    Michael Garland and Paul S. Heckbert. Surface simplification using quadric error metrics. In SIGGRAPH 97 Conference Proceedings, Annual Conference Series, pages 209–216. ACM SIGGRAPH, Addison Wesley, August 1997.Google Scholar
  6. [6]
    Reid Gershbein, Peter Schröder, and Pat Hanrahan. Textures and radiosity: Controlling emission and reflection with texture maps. In Computer Graphics (Proceedings of SIGGRAPH’ 94), pages 51–58, July 1994. http://www-graph-ics.stanford.edu/papers/texture.Google Scholar
  7. [7]
    S. Gibson and R. J. Hubbold. Efficient hierarchical refinement and clustering for radiosity in complex environments. Computer Graphics Forum, 15(5):297–310, 1996.Google Scholar
  8. [8]
    Gene Greger, Peter Shirley, Philip M. Hubbard, and Donald P. Greenberg. The irradiance volume. IEEE Computer Graphics & Applications, 18(2):32–43, March-April 1998.CrossRefGoogle Scholar
  9. [9]
    Pat Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics (SIGGRAPH’ 91 Proceedings), July 1991.Google Scholar
  10. [10]
    Hugues Hoppe. View-dependent refinement of progressive meshes. In SIGGRAPH 97 Proc., pages 189–198, August 1997.Google Scholar
  11. [11]
    I. T. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, New York, 1986.Google Scholar
  12. [12]
    Dani Lischinski, Brian Smits, and Donald P. Greenberg. Bounds and Error Estimates for Radiosity. In Computer Graphics Proceedings, Annual Conference Series, 1994 (ACM SIGGRAPH’ 94 Proceedings), pages 67–74, 1994.Google Scholar
  13. [13]
    Holly Rushmeier, Charles Patterson, and Aravindan Veerasamy. Geometric simplification for indirect illumination calculations. In Proceedings of Graphics Interface’ 93, pages 227–236, Toronto, Ontario, Canada, May 1993. Canadian Information Processing Society.Google Scholar
  14. [14]
    François Sillion, G. Drettakis, and Cyril Soler. A clustering algorithm for radiance calculation in general environments. In Eurographics Rendering Workshop 1995. Eurographics, June 1995.Google Scholar
  15. [15]
    François X. Sillion. A unified hierarchical algorithm for global illumination with scattering volumes and object clusters. IEEE Transactions on Visualization and Computer Graphics, 1(3):240–254, September 1995.CrossRefGoogle Scholar
  16. [16]
    Brian Smits, James Arvo, and Donald Greenberg. A clustering algorithm for radiosity in complex environments. In Proceedings of SIGGRAPH’ 94 (Orlando, Florida, July 24–29, 1994), Computer Graphics Proceedings, Annual Conference Series, pages 435–442. ACM SIGGRAPH, ACM Press, July 1994.Google Scholar
  17. [17]
    M. Stamminger, W. Nitsch, and Ph. Slusallek. Isotropic clustering for hierarchical radiosity — implementation and experiences. In Proc. Fifth International Conference in Central Europe on Computer Graphics and Visualization’ 97, 1997.Google 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. http://www.cs.cmu.edu/~radiosity/emprad-tr.html.Google Scholar

Copyright information

© Springer-Verlag/Wien 1999

Authors and Affiliations

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

Personalised recommendations