Fast Radiosity Using a Data Parallel Architecture

We present a data parallel algorithm for radiosity. The algorithm was designed to take advantage of large numbers of processors. It has been implemented on the Connection Machine CM2 system and scales linearly in the number of available processors over a wide range. All parts of the algorithm-form-factor computation, visibility determination, adaptive subdivision, and linear algebra solution-execute in parallel with a completely distributed database. Load balancing is achieved through processor allocation and dynamic data structures which reconfigure appropriately to match the granularity of the required calculations.

[1]  Hubert C. Delany.  Ray tracing on a connection machine , 1988, ICS.

[2]  Steven M. Drucker,et al.  A data parallel algorithm for raytracing of heterogeneous databases , 1992 .

[3]  Christophe Schlick,et al.  Two Parallel Approaches for a Progressive Radiosity , 1994 .

[4]  Takayuki Tanaka,et al.  ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.

[5]  Sabine Coquillart.  An Improvement of the Ray-tracing Algorithm , 1985, Eurographics.

[6]  Don P. Mitchell,et al.  Spectrally optimal sampling for distribution ray tracing , 1991, SIGGRAPH.

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

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

[9]  Stephen Mann,et al.  Making radiosity usable: automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions , 1991, SIGGRAPH.

[10]  Donald P. Greenberg,et al.  A two-pass solution to the rendering equation: A synthesis of ray tracing and radiosity methods , 1987, SIGGRAPH.

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

[12]  Claude Puech,et al.  Improving interaction with radiosity-based lighting simulation programs , 1990, I3D '90.

[13]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[14]  James T. Kajiya,et al.  The rendering equation , 1986, SIGGRAPH.

[15]  Daniel R. Baum,et al.  Real time radiosity through parallel processing and hardware acceleration , 1990, I3D '90.

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

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

[18]  Guy E. Blelloch,et al.  Vector Models for Data-Parallel Computing , 1990 .

[19]  Brian Wyvill,et al.  Multiprocessor Ray Tracing , 1986, Comput. Graph. Forum.

[20]  Derek J. Paddon,et al.  Parallel Processing of Progressive Refinement Radiosity Methods , 1994 .

[21]  Turner Whitted,et al.  An improved illumination model for shaded display , 1979, CACM.

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

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

[24]  Donald P. Greenberg,et al.  Acceleration techniques for progressive refinement radiosity , 1990, I3D '90.

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

[26]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[27]  Werner Purgathofer,et al.  Fast Radiosity by Parallelization , 1992 .