Parallel volume rendering with early ray termination for visualizing large-scale datasets

Authors:
Manabu Matsui;Fumihiko Ino;Kenichi Hagihara
Affiliations:
Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 9
Cited 0

Display of Surfaces from Volume Data

IEEE Computer Graphics and Applications
Efficient ray tracing of volume data

ACM Transactions on Graphics (TOG)
Segmented ray casting for data parallel volume rendering

PRS '93 Proceedings of the 1993 symposium on Parallel rendering
The design and implementation of zero copy MPI using commodity hardware with a high performance network

ICS '98 Proceedings of the 12th international conference on Supercomputing
A hierarchical data structure for multidimensional digital images

Communications of the ACM
Parallel Volume Rendering Using Binary-Swap Compositing

IEEE Computer Graphics and Applications
Fast Volume Rendering using Adaptive Block Subdivision

PG '97 Proceedings of the 5th Pacific Conference on Computer Graphics and Applications
An improved binary-swap compositing for sort-last parallel rendering on distributed memory multiprocessors

Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Visibility Culling Using Plenoptic Opacity Functions for Large Volume Visualization

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient parallel algorithm for volume rendering of large-scale datasets. Our algorithm focuses on an optimization technique, namely early ray termination (ERT), which aims to reduce the amount of computation by avoiding enumeration of invisible voxels in the visualizing volume. The novelty of the algorithm is that it incorporates this technique into a distributed volume rendering system with global reduction of the computational amount. The algorithm also is capable of statically balancing the processor workloads. The experimental results show that our algorithm with global ERT further achieves the maximum reduction of 33% compared to an earlier algorithm with local ERT. As a result, our load-balanced algorithm reduces the execution time to at least 66%, not only for dense objects but also for transparent objects.