End-to-end data reduction and hardware accelerated rendering techniques for visualizing time-varying non-uniform grid volume data

Authors:
Hiroshi Akiba;Kwan-Liu Ma;John Clyne
Affiliations:
Institute for Data Analysis and Visualization, University of California at Davis;Institute for Data Analysis and Visualization, University of California at Davis;Scientific Computing Division, National Center for Atmospheric Research, Colorado
Venue:
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Year:
2005

Citing 14
Cited 3

Multi-dimensional trees for controlled volume rendering and compression

VVS '94 Proceedings of the 1994 symposium on Volume visualization
A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree

VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
4D volume rendering with the Shear Warp factorisation

VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Adaptive texture maps

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Feature based volumetric video compression for interactive playback

VVS '02 Proceedings of the 2002 IEEE symposium on Volume visualization and graphics
Texture hardware assisted rendering of time-varying volume data

Proceedings of the conference on Visualization '01
Hierarchical Representation of Time-Varying Volume Data with "4th-root-of-2" Subdivision and Quadrilinear B-Spline Wavelets

PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Compression Domain Rendering of Time-Resolved Volume Data

VIS '95 Proceedings of the 6th conference on Visualization '95
Efficient encoding and rendering of time-varying volume data

Efficient encoding and rendering of time-varying volume data
Differential volume rendering: a fast volume visualization technique for flow animation

VIS '94 Proceedings of the conference on Visualization '94
Real-Time Volume Rendering of Time-Varying Data Using a Fragment-Shader Compression Approach

PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Compression Domain Volume Rendering

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Empty Space Skipping and Occlusion Clipping for Texture-based Volume Rendering

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
High Dimensional Direct Rendering of Time-Varying Volumetric Data

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)

Two-stage compression for fast volume rendering of time-varying scalar data

Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Technical Section: A decompression pipeline for accelerating out-of-core volume rendering of time-varying data

Computers and Graphics
Multi-layered image caching for distributed rendering of large multiresolution datasets

EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a systematic approach for direct volume rendering terascale-sized data that are time-varying, and possibly non-uniformly sampled, using only a single commodity graphics PC. Our method employs a data reduction scheme that combines lossless, wavelet-based progressive data access with a user-directed, hardware-accelerated data packing technique. Data packing is achieved by discarding data blocks with values outside the data interval of interest and encoding the remaining data in a structure that can be efficiently decoded in the GPU. The compressed data can be transferred between disk, main memory, and video memory more efficiently, leading to more effective data exploration in both spatial and temporal domains. Furthermore, our texture-map based volume rendering system is capable of correctly displaying data that are sampled on a stretched, Cartesian grid. To study the effectiveness of our technique we used data sets generated from a large solar convection simulation, computed on a non-uniform, 504 × 504 × 2048 grid.