A data distributed, parallel algorithm for ray-traced volume rendering

This paper presents a divide-and-conquer ray-traced volume rendering algorithm and a parallel image compositing method, along with their implementation and performance on the Connection Machine CM-5, and networked workstations. This algorithm distributes both the data and the computations to individual processing units to achieve fast, high-quality rendering of high-resolution data. The volume data, once distributed, is left intact. The processing nodes perform local raytracing of their subvolume concurrently. No communication between processing units is needed during this locally ray-tracing process. A subimage is generated by each processing unit and the final image is obtained by compositing subimages in the proper order, which can be determined a priori. Test results on the CM-5 and a group of networked workstations demonstrate the practicality of our rendering algorithm and compositing method.

[1]  Paul Mackerras.  A fast parallel marching-cubes implementation on the Fujitsu AP1000 , 1992 .

[2]  Henry Fuchs,et al.  Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories , 1989, SIGGRAPH.

[3]  Tom Duff,et al.  Compositing digital images , 1984, SIGGRAPH.

[4]  Doctor,et al.  Display Techniques for Octree-Encoded Objects , 1981, IEEE Computer Graphics and Applications.

[5]  C. Hansen,et al.  A data distributed, parallel algorithm for ray-traced volume rendering , 1993, Proceedings of 1993 IEEE Parallel Rendering Symposium.

[6]  Peter Schröder,et al.  Fast rotation of volume data on parallel architectures , 1991, Proceeding Visualization '91.

[7]  Marc Levoy,et al.  Efficient ray tracing of volume data , 1990, TOGS.

[8]  P. Hanrahan.  Three-pass affine transforms for volume rendering , 1990, VVS.

[9]  BentleyJon Louis.  Multidimensional binary search trees used for associative searching , 1975 .

[10]  Ross T. Whitaker,et al.  Direct visualization of volume data , 1992, IEEE Computer Graphics and Applications.

[11]  Raffaele Perego,et al.  Parallel volume visualization on a hypercube architecture , 1992, VVS.

[12]  Kwan-Liu Ma,et al.  Volume seeds: A volume exploration technique , 1991, Comput. Animat. Virtual Worlds.

[13]  P. Hanrahan.  Three-pass affine transforms for volume rendering , 1990, VVS.

[14]  Marc Levoy,et al.  Display of surfaces from volume data , 1988, IEEE Computer Graphics and Applications.

[15]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[16]  Gordon Stoll,et al.  Data parallel volume rendering as line drawing , 1992, VVS.

[17]  Bui Tuong Phong.  Illumination for computer generated pictures , 1975, Commun. ACM.

[18]  Marc Levoy,et al.  Volume rendering on scalable shared-memory MIMD architectures , 1992, VVS.

[19]  Al Geist,et al.  Network-based concurrent computing on the PVM system , 1992, Concurr. Pract. Exp..

[20]  Henry Fuchs,et al.  Near real-time shaded display of rigid objects , 1983, SIGGRAPH.

[21]  Ross N. Williams,et al.  An extremely fast Ziv-Lempel data compression algorithm , 1991, [1991] Proceedings. Data Compression Conference.

[22]  Alvy Ray Smith,et al.  3-D transformations of images in scanline order , 1980, SIGGRAPH '80.

[23]  Kwan-Liu Ma,et al.  Parallel volume visualization on workstations , 1993, Comput. Graph..

[24]  Philip K. Robertson,et al.  Volume rendering on the MasPar MP-1 , 1992, VVS.