Hierarchical Higher Order Face Cluster Radiosity

We present an algorithm for simulating diffuse interreflection in scenes composed of highly tessellated objects. The method is a higher order extension of the face cluster radiosity technique. It combines face clustering, multiresolution visibility, vector radiosity, and higher order bases with a modified progressive shooting iteration to rapidly produce visually continuous solutions with limited memory requirements. The output of the method is a vector irradiance map that partitions input models into areas where global illumination is well approximated using the selected basis. The OpenGL register combiners extension can be used to render illuminated models directly from the vector irradiance map, exploiting hardware acceleration for computing vertex radiosity on commodity graphics boards.

[1]  George Drettakis,et al.  Controlling Memory Consumption of Hierarchical Radiosity With Clustering , 1999, Graphics Interface.

[2]  Hans-Peter Seidel,et al.  Getting Rid of Links in Hierarchical Radiosity , 1998, Comput. Graph. Forum.

[3]  Philippe Gosselin,et al.  A Progressive Algorithm for Three Point Transport , 1999, Comput. Graph. Forum.

[4]  Michael Garland,et al.  Face Cluster Radiosity , 1999, Rendering Techniques.

[5]  Donald P. Greenberg,et al.  The Irradiance Volume , 1998, IEEE Computer Graphics and Applications.

[6]  Paul S. Heckbert,et al.  An Empirical Comparison of Progressive and Wavelet Radiosity , 1997, Rendering Techniques.

[7]  George Drettakis,et al.  A Practical Analysis of Clustering Strategies for Hierarchical Radiosity , 1999, Comput. Graph. Forum.

[8]  Paul S. Heckbert,et al.  Hierarchical radiosity with multiresolution meshes , 2000 .

[9]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

[10]  John M. Airey,et al.  Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations , 1990 .

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

[12]  Enrico Gobbetti,et al.  TOM: Totally Ordered Mesh a Multiresolution Structure for Time Critical Graphics Applications , 2001, Int. J. Image Graph..

[13]  Sylvain Lazard,et al.  The virtual mesh: a geometric abstraction for efficiently computing radiosity , 2001, TOGS.

[14]  Seth J. Teller,et al.  Partitioning and ordering large radiosity computations , 1994, SIGGRAPH.

[15]  Harold R. Zatz.  Galerkin radiosity: a higher order solution method for global illumination , 1993, SIGGRAPH.

[16]  Eric Maisel,et al.  A New Partitioning Method for Architectural Environments , 1998 .

[17]  Yves D. Willems,et al.  Error Control for Radiosity , 1996, Rendering Techniques.

[18]  Nicolas Holzschuch,et al.  A Novel Approach Makes Higher Order Wavelets Really Efficient for Radiosity , 2000, Comput. Graph. Forum.

[19]  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..

[20]  D.W. Fellner,et al.  Automatic creation of object hierarchies for radiosity clustering , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[21]  Shenchang Eric Chen,et al.  Incremental radiosity: an extension of progressive radiosity to an interactive image synthesis system , 1990, SIGGRAPH.

[22]  Seth J. Teller,et al.  The UC Berkeley System for Interactive Visualization of Large Architectural Models , 1996, Presence: Teleoperators & Virtual Environments.

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

[24]  Roger J. Hubbold,et al.  Efficient Hierarchical Refinement and Clustering for Radiosity in Complex Environments , 1996, Comput. Graph. Forum.

[25]  George Drettakis,et al.  A Clustering Algorithm for Radiance Calculation in General Environments , 1995, Rendering Techniques.

[26]  Eric Maisel,et al.  A new partitioning method for architectural environments , 1998, Comput. Animat. Virtual Worlds.

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