Communication costs for parallel volume-rendering algorithms
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 14 (4) , 49-58
- https://doi.org/10.1109/38.291531
Abstract
The computational expense of volume rendering motivates the development of parallel implementations on multicomputers. Parallelism achieves higher frame rates, which provide more natural viewing control and enhanced comprehension of 3D structure. Although many parallel implementations exist, we have no framework to compare their relative merits independent of host hardware. The article attempts to establish that framework by enumerating and classifying parallel volume-rendering algorithms suitable for multicomputers with distributed memory and a communication network. It determined the communication costs for classes of parallel algorithms by considering their inherent communication requirements.Keywords
This publication has 7 references indexed in Scilit:
- Segmented ray casting for data parallel volume renderingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A data distributed, parallel algorithm for ray-traced volume renderingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Achieving direct volume visualization with interactive semantic region selectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fast ray tracing casting algorithm using adaptive isotriangular subdivisionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel volume visualization on a hypercube architecturePublished by Association for Computing Machinery (ACM) ,1992
- Volume rendering on the MasPar MP-1Published by Association for Computing Machinery (ACM) ,1992
- Volume rendering on scalable shared-memory MIMD architecturesPublished by Association for Computing Machinery (ACM) ,1992