The Community for Technology Leaders
2000 IEEE Symposium on Volume Visualization (VV 2000) (2000)
Salt Lake City, UT, USA
Oct. 9, 2000 to Oct. 10, 2000
ISBN: 1-58113-308-1
pp: 81-90
ABSTRACT
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splatting, shear-warp, and hardware-assisted 3D texture-mapping. In order to assess both the strengths and the weaknesses of these algorithms in a wide variety of scenarios, a set of real-life benchmark datasets with different characteristics was carefully selected. In the rendering, all algorithm-independent image synthesis parameters, such as viewing matrix, transfer functions, and optical model, were kept constant to enable a fair comparison of the rendering results. Both image quality and computational complexity were evaluated and compared, with the aim of providing both researchers and practitioners with guidelines on which algorithm is most suited in which scenario. Our analysis also indicates the current weakness in each algorithm's pipeline, and possible solutions to these as well as pointers for future research are offered.
INDEX TERMS
Rendering (computer graphics), Image generation, Transfer functions, Image quality, Computational complexity, Guidelines, Algorithm design and analysis, Pipelines
CITATION

J. Huang, K. Mueller, R. Crawfis, D. Bartz and M. Meissner, "A Practical Evaluation of Popular Volume Rendering Algorithms," 2000 IEEE Symposium on Volume Visualization (VV 2000)(VV), Salt Lake City, UT, USA, , pp. 81-90.
doi:10.1109/VV.2000.10009
180 ms
(Ver 3.3 (11022016))