Compression-Based Ray Casting of Very Large Volume Data in Distributed Environments

Authors:
Chandrajit Bajaj;Insung Ihm;Sanghun Park;Dongsub Song
Affiliations:
-;-;-;-
Venue:
HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Year:
2000

Citing 0
Cited 3

Visibility Culling Using Plenoptic Opacity Functions for Large Volume Visualization

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Giga-scale multiresolution volume rendering on distributed display clusters

HCIV'09 Proceedings of the Second IFIP WG 13.7 conference on Human-computer interaction and visualization
Survey of parallel and distributed volume rendering: revisited

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a new parallel/distributed ray-casting scheme for very large volume data that can be effectively used in distributed environments. Our method, based on data compression, attempts to enhance the rendering speedups by quickly reconstructing voxel data from local memory rather than expensively fetching them from remote memory spaces. Our compression-based volume rendering scheme minimizes communications between processing elements during rendering computation, hence is very appropriate for both distributed-memory multiprocessors and PC/workstation clusters, where the relatively high communication costs often hinder efficient parallel/distributed processing. We report experimental results on both a Cray T3E and a PC/workstation cluster for the Visible Man dataset.