4462

Fast High-Quality Volume Ray Casting with Virtual Samplings

Byeonghun Lee, Jihye Yun, Jinwook Seo, Byonghyo Shim, Yeong-Gil Shin, Bohyoung Kim
Seoul Nat. Univ., Seoul, South Korea
IEEE Transactions on Visualization and Computer Graphics, 2010

@article{lee2010fast,

   title={Fast High-Quality Volume Ray Casting with Virtual Samplings},

   author={Lee, B. and Yun, J. and Seo, J. and Shim, B. and Shin, Y.G. and Kim, B.},

   journal={Visualization and Computer Graphics, IEEE Transactions on},

   volume={16},

   number={6},

   pages={1525–1532},

   year={2010},

   publisher={IEEE}

}

Source Source   

2033

views

Volume ray-casting with a higher order reconstruction filter and/or a higher sampling rate has been adopted in direct volume rendering frameworks to provide a smooth reconstruction of the volume scalar and/or to reduce artifacts when the combined frequency of the volume and transfer function is high. While it enables high-quality volume rendering, it cannot support interactive rendering due to its high computational cost. In this paper, we propose a fast high-quality volume ray-casting algorithm which effectively increases the sampling rate. While a ray traverses the volume, intensity values are uniformly reconstructed using a high-order convolution filter. Additional samplings, referred to as virtual samplings, are carried out within a ray segment from a cubic spline curve interpolating those uniformly reconstructed intensities. These virtual samplings are performed by evaluating the polynomial function of the cubic spline curve via simple arithmetic operations. The min max blocks are refined accordingly for accurate empty space skipping in the proposed method. Experimental results demonstrate that the proposed algorithm, also exploiting fast cubic texture filtering supported by programmable GPUs, offers renderings as good as a conventional ray-casting algorithm using high-order reconstruction filtering at the same sampling rate, while delivering 2.5x to 3.3x rendering speed-up.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: