Title

Optimal Parallel Algorithm For Volume Ray Casting

Abstract

Volume rendering by ray casting is a computation-ally 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 2563, 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(log3 n) time using O(n3/log3 n) processors. We have implemented our algorithm on MasPar MP1200. The implementation results show that a frame from 2563 data size is generated in 11 seconds using 4096 processors. This time can be further reduced by using a large number of processors.

Publication Date

1-1-1995

Publication Title

Frontiers of Massively Parallel Computation - Conference Proceedings

Number of Pages

238-245

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0029205025 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS