Premium
Shear–rotation–warp volume rendering
Author(s) -
Kye Heewon,
Shin ByeongSeok,
Shin Yeong Gil,
Hong Helen
Publication year - 2005
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.67
Subject(s) - computer science , rendering (computer graphics) , tiled rendering , exploit , volume rendering , computer graphics (images) , computation , texture memory , 3d rendering , image based modeling and rendering , computer vision , tree traversal , software rendering , artificial intelligence , algorithm , computer graphics , 3d computer graphics , computer security
Shear–warp volume rendering has the advantages of a moderate image quality and a fast rendering speed. However, in the case of dynamic changes in the opacity transfer function, the efficiency of memory access drops, as the method cannot exploit pre‐classified volumes. In this paper, we propose an efficient algorithm that exploits the spatial locality of memory references for interactive classifications. The algorithm inserts a rotation matrix when factorizing the viewing transformation, so that it may perform a scanline‐based traversal in both object space and image space. In addition, we present solutions to some problems of the proposed method, namely inaccurate front‐to‐back composition, the occurrence of holes, and increased computation. Our method is noticeably faster than traditional shear‐warp rendering methods because of an improved utilization of cache memory. Copyright © 2005 John Wiley & Sons, Ltd.