Parallel volume visualization on workstations

Abstract This paper discusses the use of general-purpose graphics workstations for interactive high-resolution volume visualization. We survey previous research results in parallel volume rendering as well as commercial products that take advantage of parallel processing to make volume rendering a practical visualization method. Our focus is on developing distributed computation methods that can distribute the memory and computational demands of volume visualization across a network of general purpose workstations. We describe three distributed computation strategies based on ray-casting volume rendering that can be implemented on either shared-memory multiprocessor workstations or on a network of ordinary workstations. Multiple views of real-time feature extraction give tremendous insight to the volume data. Multiple variable visualization helps scientists to capture the interaction between important variables in a simulation. Divide-and-conquer rendering allows interactive high-resolution volume visualization of large data sets on a network of midrange workstations, even when the data set is too large for available memory on any single workstation. Several examples in medical imaging and computational fluid dynamics are shown illustrating the practicality of these methods.

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

[2]  Lee Westover,et al.  Interactive volume rendering , 1989, VVS '89.

[3]  Kwan-Liu Ma,et al.  Volume seedlings , 1992, I3D '92.

[4]  Stuart A. Green,et al.  Parallel processing for computer graphics , 1991, Research monographs in parallel and distributed computing.

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

[6]  Pat Hanrahan,et al.  Volume Rendering , 2020, Definitions.

[7]  Kwan-Liu Ma,et al.  Virtual Smoke: an interactive 3D flow visualization technique , 1992, Proceedings Visualization '92.

[8]  Craig Upson,et al.  V-buffer: visible volume rendering , 1988, SIGGRAPH.

[9]  Arie E. Kaufman,et al.  Memory and processing architecture for 3D voxel-based imagery , 1988, IEEE Computer Graphics and Applications.

[10]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[11]  Ross T. Whitaker,et al.  Achieving direct volume visualization with interactive semantic region selection , 1991, Proceeding Visualization '91.

[12]  David R. Nadeau,et al.  NetV: an experimental network-based volume visualization system , 1991, Proceeding Visualization '91.

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

[14]  Ned Snell Fiserv Inc. , 1993 .

[15]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

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

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

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

[19]  Anita Osterhaug Guide to parallel programming on Sequent computer systems , 1989 .

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

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