Parallel volume rendering using binary-swap compositing
Kwan‐Liu Ma, James S. Painter, Charles D. Hansen et al. · IEEE Computer Graphics and Applications · 1994
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.>
Cited by 264 works. doi:10.1109/38.291532
Authors
References
- Multidimensional binary search trees used for associative searching
- Display of surfaces from volume data
- Compositing digital images
- Compositing digital images
- Near real-time shaded display of rigid objects
- Network‐based concurrent computing on the PVM system
- Near real-time shaded display of rigid objects
- An extremely fast Ziv-Lempel data compression algorithm
- Segmented ray casting for data parallel volume rendering
- Parallel volume-rendering algorithm performance on mesh-connected multicomputers