Title

Optimal Parallel Algorithm For Volume Ray Casting

Abstract

Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (30 frames/sec). Since the typical 3-D dataset size is at least 1283, the use of parallel processing is imperative. In this paper, we present an O(log n) EREW algorithm for volume rendering using O(n3) processors which can be optimized to O(log3n) time using O(n3/log3n) processors. We have implemented our algorithm on MasPar MP1200. The implementation results show that a frame from 1233 data size is generated in about 3 seconds using 4096 processors.

Publication Date

1-1-1995

Publication Title

IEEE Symposium on Parallel and Distributed Processing - Proceedings

Number of Pages

707-711

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0029239529 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0029239529

This document is currently not available here.

Share

COinS