1636

Empty Space Skipping and Occlusion Clipping for Texture-based Volume Rendering

W. Li, K. Mueller, A. Kaufman
Center for Visual Computing (CVC) and Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400
In VIS ’03: Proceedings of the 14th IEEE Visualization 2003 (VIS’03) (2003)

@conference{li2003empty,

   title={Empty space skipping and occlusion clipping for texture-based volume rendering},

   author={Li, W. and Mueller, K. and Kaufman, A.},

   booktitle={Proceedings of the 14th IEEE Visualization 2003 (VIS’03)},

   pages={42},

   isbn={0769520308},

   year={2003},

   organization={IEEE Computer Society}

}

Download Download (PDF)   View View   Source Source   

644

views

We propose methods to accelerate texture-based volume rendering by skipping invisible voxels. We partition the volume into sub-volumes, each containing voxels with similar properties. Sub-volumes composed of only voxels mapped to empty by the transfer function are skipped. To render the adaptively partitioned sub-volumes in visibility order, we reorganize them into an orthogonal BSP tree. We also present an algorithm that computes incrementally the intersection of the volume with the slicing planes, which avoids the overhead of the intersection and texture coordinates computation introduced by the partitioning. Rendering with empty space skipping is 2 to 5 times faster than without it. To skip occluded voxels, we introduce the concept of orthogonal opacity map, that simplifies the transformation between the volume coordinates and the opacity map coordinates, which is intensively used for occlusion detection. The map is updated efficiently by the GPU. The sub-volumes are then culled and clipped against the opacity map. We also present a method that adaptively adjusts the optimal number of the opacity map updates. With occlusion clipping, about 60% of non-empty voxels can be skipped and an additional 80% speedup on average is gained for iso-surface-like rendering.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: