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
Previous work in single-processor ray casting methods for volume rendering has concentrated on algor...
This paper describes a new algorithm and hardware design for the generation of two dimensional image...
Real-time visualization of large volume datasets demands high performance computation, pushing the s...
Volume rendering by ray casting is a computationally expensive problem. For interactive volume visua...
Volume rendering by ray casting is computationally expensive. For interactive volume visualization, ...
The Volume Ray-Casting rendering algorithm, often used to produce medical imaging, is a well-known a...
Volume rendering, i.e. direct rendering of regular volume data and not via surface primitives, is a ...
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in ar...
In this paper we present a data parallel volume rendering algorithm with numerous advantages over pr...
The rapid development of digital technology has enabled the real-time volume rendering of scientific...
Volume rendering is a key technique in scientific visualization that lends itself to significant exp...
The development of effective parallel rendering algorithms for unstructured volume data is challengi...
Figure 1: Several volumes rendered on the VolumePro hardware at 30 frames per second. This paper des...
Volume rendering is a key technique in scientific visualization that lends itself to significant exp...
Volume rendering is a technique to display 3D volumetric data sets as 2D images. Main computation in...
Previous work in single-processor ray casting methods for volume rendering has concentrated on algor...
This paper describes a new algorithm and hardware design for the generation of two dimensional image...
Real-time visualization of large volume datasets demands high performance computation, pushing the s...
Volume rendering by ray casting is a computationally expensive problem. For interactive volume visua...
Volume rendering by ray casting is computationally expensive. For interactive volume visualization, ...
The Volume Ray-Casting rendering algorithm, often used to produce medical imaging, is a well-known a...
Volume rendering, i.e. direct rendering of regular volume data and not via surface primitives, is a ...
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in ar...
In this paper we present a data parallel volume rendering algorithm with numerous advantages over pr...
The rapid development of digital technology has enabled the real-time volume rendering of scientific...
Volume rendering is a key technique in scientific visualization that lends itself to significant exp...
The development of effective parallel rendering algorithms for unstructured volume data is challengi...
Figure 1: Several volumes rendered on the VolumePro hardware at 30 frames per second. This paper des...
Volume rendering is a key technique in scientific visualization that lends itself to significant exp...
Volume rendering is a technique to display 3D volumetric data sets as 2D images. Main computation in...
Previous work in single-processor ray casting methods for volume rendering has concentrated on algor...
This paper describes a new algorithm and hardware design for the generation of two dimensional image...
Real-time visualization of large volume datasets demands high performance computation, pushing the s...