Share Email Print

Proceedings Paper

Improved ray-casting algorithm for volume visualization
Author(s): Shi-Nine Yang; Tian-Sheng Wu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Applications in scientific visualization often involve extensive data sets, which represent scalar or vector valued functions resulting from experimental measurements. Ray Casting (RC) is a well-known approach for visualizing a multi-dimensional volume data. It casts a large number of rays from the viewer into the volume and then computes the progressive attenuation along each ray in the volume. It is known that the ray-casting algorithm requires extensive computation time. In this study, we propose two techniques to speed up the ray-casting process. First, we derive an estimation of ray step sizes during its progressive re-sampling without invocating viewing transformation operations. Hence lengthy computations of trigonometric functions and matrix multiplications can be avoided. Furthermore, by exploring the ray coherence property, we propose a scan-line algorithm so that ray/volume intersections can be found efficiently. The proposed algorithm is implemented and compared with the conventional RC algorithm. Experimental results show that the proposed algorithm performs three to four times faster than the conventional RC algorithm.

Paper Details

Date Published: 12 March 2002
PDF: 8 pages
Proc. SPIE 4665, Visualization and Data Analysis 2002, (12 March 2002); doi: 10.1117/12.458800
Show Author Affiliations
Shi-Nine Yang, National Tsing Hua Univ. (Taiwan)
Tian-Sheng Wu, Hwa Hsia College of Technology and Commerce (Taiwan)

Published in SPIE Proceedings Vol. 4665:
Visualization and Data Analysis 2002
Robert F. Erbacher; Philip C. Chen; Matti Groehn; Jonathan C. Roberts; Craig M. Wittenbrink, Editor(s)

© SPIE. Terms of Use
Back to Top