A-PARM: Adaptive Division of Sub-cells in the PARM for Efficient Volume Ray Casting

Authors:
Sukhyun Lim;Byeong-Seok Shin
Affiliations:
Inha University, Dept. Computer Science and Information Engineering, 253 Yonghyun-dong, Nam-gu, Inchon, 402-751, Rep. of Korea;Inha University, Dept. Computer Science and Information Engineering, 253 Yonghyun-dong, Nam-gu, Inchon, 402-751, Rep. of Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 11
Cited 0

Display of Surfaces from Volume Data

IEEE Computer Graphics and Applications
Fast volume rendering using a shear-warp factorization of the viewing transformation

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Interactive ray tracing for isosurface rendering

Proceedings of the conference on Visualization '98
QSplat: a multiresolution point rendering system for large meshes

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
The ULTRAVIS system

VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Volume Visualization (Tutorial)

Volume Visualization (Tutorial)
A new object-order ray-casting algorithm

Proceedings of the conference on Visualization '02
Extended Specifications and Test Data Sets for Data Level Comparisons of Direct Volume Rendering Algorithms

IEEE Transactions on Visualization and Computer Graphics
Memory Efficient Acceleration Structures and Techniques for CPU-Based Volume Raycasting of Large Data

VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Real-time Volume Graphics

Real-time Volume Graphics
PARM: data structure for efficient volume ray casting

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The PARM is a data structure to ensure interactive frame rates on a PC platform for CPU-based volume ray casting. After determining candidate cells that contribute to the final images, it partitions each candidate cell into several sub-cells. Then, it stores trilinearly interpolated scalar value and an index of encoded gradient vector for each sub-cell. Since the information that requires time-consuming computations is already stored in the structure, the rendering time is reduced. However, it requires huge memory space because most precomputed values are loaded in the system memory. We solve it by adaptively dividing candidate cells into different sub-cells. That is, we divide a candidate cell in which the gradient is strictly changed into a large number of sub-cells, and vice versa. By this approach, we acquire moderate images while reducing the memory size.