Interactive ray tracing for volume visualization
S. Parker, M. Parker, Yarden Livnat et al. · IEEE Transactions on Visualization and Computer Graphics · 1999
Presents a brute-force ray-tracing system for interactive volume visualization. The system runs on a conventional (distributed) shared-memory multiprocessor machine. For each pixel, we trace a ray through a volume to compute the color for that pixel. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large data sets on current high-end parallel systems. To gain efficiency, several optimizations are used, including a volume bricking scheme and a shallow data hierarchy. These optimizations are used in three separate visualization algorithms: isosurfacing of rectilinear data, isosurfacing of unstructured data, and maximum-intensity projection on rectilinear data. The system runs interactively (i.e. at several frames per second) on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.
Cited by 192 works. doi:10.1109/2945.795215
Authors
References
- Marching cubes: A high resolution 3D surface construction algorithm
- Marching cubes: A high resolution 3D surface construction algorithm
- Display of surfaces from volume data
- Volume rendering
- Data structure forsoft objects
- Efficient ray tracing of volume data
- V-buffer
- A rendering algorithm for visualizing 3D scalar fields
- ARTS: Accelerated Ray-Tracing System
- Octrees for faster isosurface generation