Huge three-dimensional data sets have to be compressed for visualization if they do not fit into the main memory of todays work stations. A possible approach is to use sparse grids featuring very simple basis functions for interpolation.
Sparse grids are also of increasing interest in numerical simulations.
The visualization algorithms that are available so far could not cope with sparse grids. Now we present some approaches that directly work on sparse grids. For getting interactive rates at visualizing sparse grid volumes, we introduce an interpolation algorithm that harnesses silicon graphics hardware for acceleration purposes. Rotating view of the pressure of a simulated cavity flow, visualized with the combination technique. For interpolation all basis functions that are accessed during the hierarchy traversal have to be evaluated.