Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12]


Journal of Information Science and Engineering, Vol. 21 No. 2, pp. 327-339 (March 2005)

Parallel Volume Rendering with Sparse Data Structures*

Jenshiuh Liu, Chih-Hsien Huang and Don-Lin Yang
Department of Information Engineering and Computer Science
Feng Chia University
Taichung, 40 Taiwan

Direct volume rendering is a popular technique for scientifc visualization. The computation cost of direct volume rendering increases exponentially as the size of the volume dataset increases. Hence, efficient volume rendering has become an important issue. In this work, we study parallel volume rendering algorithms based on sparse data structures. In order to exploit object space coherence, we propose to employ two sparse-matrix representation schemes as spatial data structures. To further reduce the processing time, we employ data-parallel volume rendering algorithms based on sparse data structures. Two distinct features of our work are: (a) the sparse data structures enable us to reduce the processing time as well as the memory storage requirement; and (b) parallel processing allows us to further speed up the volume rendering process. Experiments were conducted to assess our proposed scheme. Results show that our proposed data parallel algorithms performed well on two different parallel distributed memory systems.

Keywords: volume rendering, sparse data structure, data-parallel, algorithm, splatting

Full Text () Retrieve PDF document (200503_05.pdf)

Received June 6, 2003; revised July 20, 2004; accepted September 9, 2004.
Communicated by Gen-Huey Chen.
* A preliminary version of this paper has been appeared in Proceedings of 14th IASTED International Conference on Parallel and Distributed Computing and System, 2002, pp. 594-599.
* This work was sponsored in part by a grand from Natioanl Science Council of R.O.C. under contract no. NSC90-2213E-035-033.