An optimal parallel algorithm for volume ray casting
Vineet Goel, Amar Mukherjee · 2002
Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (3D frames/sec). Since the typical 3D dataset size is at least 128/sup 3/, the use of parallel processing is imperative. We present an O(log n) EREW algorithm for volume rendering using O(n/sup 3/) processors which can be optimized to O(log/sup 3/ n) time using O(n/sup 3//log/sup 3/ n) processors. We have implemented our algorithm on MasPar MPl200. The implementation results show that a frame from 123/sup 3/ data size is generated in about 3 seconds using 4096 processors.>