A distributed memory algorithm for volume rendering

Three-dimensional arrays of digital data representing spatial volumes are generated from such diverse fields as the geosciences, space exploration and astrophysics, medical imaging, computational fluid dynamics, molecular modeling, microelectronic field modeling and computer simulation, With current...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the Scalable High-Performance Computing Conference, May 23-25, 1994, Knoxville, Tennessee pp. 247 - 251
Main Authors: Tiwari, R., Huntsberger, T.L.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1994
Subjects:
Application software
Astrophysics
Biomedical imaging
Computational fluid dynamics
Computer simulation
Geology
High performance computing
Microelectronics
Partitioning algorithms
Space exploration
ISBN:0818656808, 9780818656804
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Three-dimensional arrays of digital data representing spatial volumes are generated from such diverse fields as the geosciences, space exploration and astrophysics, medical imaging, computational fluid dynamics, molecular modeling, microelectronic field modeling and computer simulation, With current advances in imaging devices and high performance computing, more and more applications will generate volumetric data in the near future. The paper presents a new distributed memory algorithm for volume rendering in a message-passing environment. The algorithm, which uses a slab technique for data partitioning, is a hybrid between the ray-casting and cell projection approaches for volumetric rendering. The results of some scaling experiments using ParaSoft Express on an Intel Paragon at the University of South Carolina are also presented.< >
ISBN:0818656808
9780818656804
DOI:10.1109/SHPCC.1994.296650