Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An optimal parallel algorithm for volume ray casting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Goel, V. ; Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA ; Mukherjee, A.

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 256 3 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

Published in:

Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the

Date of Conference:

6-9 Feb 1995