Fast Volume Rendering of Sparse High-Resolution Datasets Using Adaptive Mesh Refinement Hierarchies
Please always quote using this URN: urn:nbn:de:0297-zib-6516
- In this paper we present an algorithm that accelerates 3D texture-based volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and the number of texture bricks -- a prerequisite for fast rendering. Comparing our approach to an octree based algorithm we show that our algorithm increases rendering performance significantly for sparse data. A further advantage is that less parameter tuning is necessary.
Download full text files
Additional Services
| Author: | Ralf Kähler, Mark Simon, Hans-Christian HegeORCiDGND |
|---|---|
| Document Type: | ZIB-Report |
| Tag: | 3D texture mapping; AMR tree; hierarchical space partitioning; octree; scalar field visualization; spar; volume rendering; volume visualization |
| MSC-Classification: | 68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area) / 68Uxx Computing methodologies and applications / 68U05 Computer graphics; computational geometry [See also 65D18] |
| Date of first Publication: | 2001/09/28 |
| Series (Serial Number): | ZIB-Report (01-25) |
| ZIB-Reportnumber: | 01-25 |
| Published in: | Appeared in: IEEE Transactions on Visualization and Computer Graphics 9 (2003) 341 -351 under the title: Interactive volume rendering of large sparse data sets using adaptive mesh refinement hierarchies |
