A rapid hierarchical radiosity algorithm

This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing large polygonal patches. The algorithm constructs a hierarchical representation of the form factor matrix by adaptively subdividing patches into subpatches according to a user-supplied error bound. The algorithm guarantees that all form factors are calculated to the same precision, removing many common image artifacts due to inaccurate form factors. More importantly, the algorithm decomposes the form factor matrix into at most O(n) blocks (where n is the number of elements). Previous radiosity algorithms represented the element-to-element transport interactions with n2 form factors. Visibility algorithms are given that work well with this approach. Standard techniques for shooting and gathering can be used with the hierarchical representation to solve for equilibrium radiosities, but we also discuss using a brightness-weighted error criteria, in conjunction with multigridding, to even more rapidly progressively refine the image.

[1]  Andrew W. Appel,et al.  An Efficient Program for Many-Body Simulation , 1983 .

[2]  Donald P. Greenberg,et al.  The hemi-cube: a radiosity solution for complex environments , 1985, SIGGRAPH.

[3]  Donald P. Greenberg,et al.  An Efficient Radiosity Approach for Realistic Image Synthesis , 1986, IEEE Computer Graphics and Applications.

[4]  Henry Fuchs,et al.  Image rendering by adaptive refinement , 1986, SIGGRAPH.

[5]  Robert L. Cook,et al.  Stochastic sampling in computer graphics , 1988, TOGS.

[6]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[7]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[8]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[9]  Donald P. Greenberg,et al.  A progressive refinement approach to fast radiosity image generation , 1988, SIGGRAPH.

[10]  John R. Wallace,et al.  A Ray tracing algorithm for progressive radiosity , 1989, SIGGRAPH '89.

[11]  Claude Puech,et al.  A general two-pass method integrating specular and diffuse reflection , 1989, SIGGRAPH '89.

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

[13]  Donald S. Fussell,et al.  Adaptive mesh generation for global diffuse illumination , 1990, SIGGRAPH.

[14]  James F. Blinn.  Triage tables , 1990, IEEE Computer Graphics and Applications.

[15]  Paul S. Heckbert.  Adaptive radiosity textures for bidirectional ray tracing , 1990, SIGGRAPH.

[16]  Klaas Esseling.  The Order of Appel's Algorithm , 1992, Inf. Process. Lett..

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