This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Volume Rendering Using Binary-Swap Compositing
July/August 1994 (vol. 14 no. 4)
pp. 59-68

We describe a parallel volume-rendering algorithm, which consists of two parts: parallel ray tracing and parallel compositing. In the most recent implementation on Connection Machine's CM-5 and networked workstations, the parallel volume renderer evenly distributes data to the computing resources available. Without the need to communicate with other processing units, each subvolume is ray traced locally and generates a partial image. The parallel compositing process then merges all resulting partial images in depth order to produce the complete image. The compositing algorithm is particularly effective for massively parallel processing, as it always uses all processing units by repeatedly subdividing the partial images and distributing them to the appropriate processing units. Test results on both the CM-5 and the workstations are promising. They do, however, expose different performance issues for each platform.

1. W.M. Hsu, "Segmented Ray Casting for Data Parallel Volume Rendering,"Proc. 1993 Parallel Rendering Symp., IEEE CS Press, Los Alamitos, Calif., Order No. 4920, 1993, pp. 7-14.
2. E. Camahort and I. Chakravarty, "Integrating Volume Rendering on Distributed Memory Architectures,"Proc. 1993 Parallel Rendering Symp., ACM Press, New York, 1993, pp. 89-96.
3. U. Neumann, "Parallel Volume-Rendering Algorithm Performance on Mesh-Connected Multicomputers,"Proc. Parallel Rendering Symp., ACM, New York, 1993, pp. 97-104.
4. B. Corrie and P. Mackerras, "Parallel Volume Rendering and Data Coherence,"Proc. Parallel Rendering Symp., ACM, New York, 1993, pp. 23-26.
5. K.-L. Ma and J.S. Painter, "Parallel Volume Visualization and Data Coherence,"Computers and Graphics, Vol. 17, No. 1, 1993, pp. 31- 37.
6. M. Levoy, "Display of Surfaces from Volume Data,"IEEE CG&A, Vol. 8, No. 3, May 1988, pp. 29-37.
7. T. Porter and T. Duff, "Compositing Digital Images,"Computer Graphics(Proc. Siggraph), Vol. 18, No. 3, July 1984, pp. 253-259.
8. J. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching,"Comm. ACM, Vol. 18, No. 9, Sept. 1975, pp. 509- 517.
9. H. Fuchs, G. Abram, and E.D. Grant, "Near Real-Time Shade Display of Rigid Objects,"Computer Graphics(Proc. Siggraph), Vol. 17, No. 3, July 1983, pp. 65-72.
10. P. Mackerras, "A Fast Parallel Marching Cubes Implementation on the Fujitsu AP1000," Tech Report TR-CS-92-10, Dept. of Computer Science, Australian National University, 1992.
11. Thinking Machines Corp.,The Connection Machine CM-5 Technical Summary, Cambridge, Mass., 1991.
12. G. Geist and V. Sunderam, "Network-based Concurrent Computing on the PVM System,"Concurrency: Practice and Experience, Vol. 4, June 1992, pp. 293-312.
13. R. Williams, "An Extremely Fast Ziv-Lempel Data Compression Algorithm," inProc. IEEE Computer Society Data Compression Conf., J. Storer and J. Reif, eds., IEEE Computer Society, Los Alamitos, Calif., 1991.

Citation:
Kwan-Liu Ma, James S. Painter, Charles D. Hansen, Michael F. Krogh, "Parallel Volume Rendering Using Binary-Swap Compositing," IEEE Computer Graphics and Applications, vol. 14, no. 4, pp. 59-68, July-Aug. 1994, doi:10.1109/38.291532
Usage of this product signifies your acceptance of the Terms of Use.