Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
A data distributed, parallel algorithm for ray-traced volume rendering
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Multidimensional binary search trees used for associative searching
Communications of the ACM
IEEE Computer Graphics and Applications
High performance visualization of time-varying volume data over a wide-area network status
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Texture hardware assisted rendering of time-varying volume data
Proceedings of the conference on Visualization '01
A Hardware-Assisted Scalable Solution for Interactive Volume Rendering of Time-Varying Data
IEEE Transactions on Visualization and Computer Graphics
PVR: High-Performance Volume Rendering
IEEE Computational Science & Engineering
Visualizing Time-Varying Volume Data
Computing in Science and Engineering
High performance approach for inner structures visualisation in medical data
International Journal of Computer Applications in Technology
Combining in-situ and in-transit processing to enable extreme-scale scientific analysis
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Exploring power behaviors and trade-offs of in-situ data analytics
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
This paper presents a parallel ray-casting volume rendering algorithm and its implementation on the massively parallel IBM SP-1 computer using the Chameleon message passing library. Though this algorithm takes advantage of many of the unique features of the SP-1 (e.g. high-speed switch, large memory per node, high-speed disk array, HIPPI display, et al), the use of Chameleon allows the code to be executed on any collection of workstations.The algorithm is image-ordered and distributes the data and the computational load to individual processors. After the volume data is distributed, all processors then perform local raytracing of their respective subvolumes concurrently. No interprocess communication takes place during the ray tracing process. After a subimage is generated by each processor, the final image is obtained by composing subimages between all the processers.The program itself is implemented as an interactive process through a GUI residing on a graphics work-station which is coupled to the parallel rendering algorithm via sockets. The paper highlights the Chameleon implementation, the GUI, some optimization improvements, static load balancing, and direct parallel display to a HIPPI framebuffer.