An octree-based multiresolution approach supporting interactive rendering of very large volume data sets

Author(s): Pinskiy, Dimitriy V.; Brugger, Eric S.; Childs, Hank; Hamann, Bernd | Abstract: We present an octree-based approach supporting multiresolution volume rendering of large data sets. Given a set of scattered points without connectivity information, we impose an actree data structure of low resolution in the preprocessing step. The construction of this initial octree structure of low resolution in the preprocessing step. The construction of this initial octree structure is controlled by the original data resolution and cell-specific error values. Using the octree nodes, rather than the data points, as elementary units for ray casting, we first generate a crude rendering of a given data set. Keeping the pre-processing step independent from the rendering step, we allow a user to interactively explore a large data set by speicifying a region of interest (ROI), where a higher level of rendering accuracy is desired. To refine an ROI, we are making use of the octree constructed in the pro-processing step. Our approach is aimed at minimizing the number of computations and can be applied to large-scale data exploration tasks.

[1]  Pat Hanrahan,et al.  Hierarchical splatting: a progressive refinement algorithm for volume rendering , 1991, SIGGRAPH.

[2]  Ming Wan,et al.  High performance presence-accelerated ray casting , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[3]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[4]  L. De Floriani A pyramidal data structure for triangle-based surface description , 1989, IEEE Computer Graphics and Applications.

[5]  Bernd Hamann,et al.  A data reduction scheme for triangulated surfaces , 1994, Comput. Aided Geom. Des..