Efficient Hierarchical Refinement and Clustering for Radiosity in Complex Environments

Generating accurate radiosity solutions of very complex environments is a time‐consuming problem. We present a rapid hierarchical algorithm that enables such solutions to be computed quickly and efficiently. Firstly, a new technique for bounding the error in the transfer of radiosity between surfaces is discussed, incorporating bounds on form factors, visibility, irradiance, and reflectance over textured surfaces. This technique is then applied to the problem of bounding radiosity transfer between clusters of surfaces, leading to a fast, practical clustering algorithm that builds on the previous work of Sillion1. Volumes are used to represent clusters of small surfaces, but unlike previous algorithms, the orientations of surfaces inside each cluster are accounted for in both the error bound and radiosity transfer. This enables an accurate solution to be generated very efficiently, and results are presented demonstrating the performance of the algorithm on a variety of complex models, one containing almost a quarter of a million initial surfaces.

[1]  John Amanatides,et al.  A Fast Voxel Traversal Algorithm for Ray Tracing , 1987, Eurographics.

[2]  Lance Williams,et al.  Pyramidal parametrics , 1983, SIGGRAPH.

[3]  James Arvo,et al.  A clustering algorithm for radiosity in complex environments , 1994, SIGGRAPH.

[4]  George Drettakis,et al.  Feature-based control of visibility error: a multi-resolution clustering algorithm for global illumination , 1995, SIGGRAPH.

[5]  Dani Lischinski,et al.  Bounds and error estimates for radiosity , 1994, SIGGRAPH.

[6]  François X. Sillion,et al.  A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters , 1995, IEEE Trans. Vis. Comput. Graph..

[7]  Brian Wyvill,et al.  ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING , 1988 .

[8]  Dani Lischinski,et al.  Combining hierarchical radiosity and discontinuity meshing , 1993, SIGGRAPH.

[9]  David Salesin,et al.  An importance-driven radiosity algorithm , 1992, SIGGRAPH.

[10]  P. Hanrahan,et al.  A Rapid Hierarchical Radiosity Algorithm for Unoccluded Environments , 1992 .

[11]  Donald P. Greenberg,et al.  Global Illumination via Density Estimation , 1995, Rendering Techniques.

[12]  David Salesin,et al.  Clustering for glossy global illumination , 1997, TOGS.

[13]  Pat Hanrahan,et al.  Textures and radiosity: controlling emission and reflection with texture maps , 1994, SIGGRAPH.

[14]  Pat Hanrahan,et al.  A rapid hierarchical radiosity algorithm , 1991, SIGGRAPH.

[15]  Daniel R. Baum,et al.  Improving radiosity solutions through the use of analytically determined form-factors , 1989, SIGGRAPH.

[16]  Michael F. Cohen,et al.  Radiosity and realistic image synthesis , 1993 .

[17]  Donald P. Greenberg,et al.  Modeling the interaction of light between diffuse surfaces , 1984, SIGGRAPH.