3D ROAM for scalable volume visualization

The 2D real time optimally adapting meshes (ROAM) algorithm has had wide success in the field of terrain visualization, because of its efficient error-controlling properties. In this paper, we propose a generalization of ROAM in 3D suitable for scalable volume visualization. Therefore, we perform a straightforward 2D/3D analogy, replacing the triangle of 2D ROAM by its 3D equivalent, the tetrahedron. Although work in the field of hierarchical tetrahedral meshes was widely undertaken, the produced meshes were not used for volumetric rendering purposes. We explain how to compute a bounded error inside the tetrahedron to build a hierarchical tetrahedral mesh and how to refine this mesh in real time to adapt it to the viewing conditions. We further show how to achieve cell sorting in linear time, thus yielding real time view-dependent display of the volumetric object. We present examples of large volume data sets and compare our approach with a similar one. Our results outline the high quality and computational efficiency of our approach.

[1]  Martin Kraus,et al.  Hardware-based ray casting for tetrahedral meshes , 2003, IEEE Visualization, 2003. VIS 2003..

[2]  Wolfgang Straßer,et al.  Advanced techniques for high-quality multi-resolution volume rendering , 2004, Comput. Graph..

[3]  Rhadamés Carmona,et al.  Octreemizer: A Hierarchical Approach for Interactive Roaming Through Very Large Volumes , 2002, VisSym.

[4]  Luiz Velho,et al.  A Generic Programming Approach to Multiresolution Spatial Decompositions , 2002, VisMath.

[5]  Martin Kraus,et al.  High-quality pre-integrated volume rendering using hardware-accelerated pixel shading , 2001, HWWS '01.

[6]  StefanGuthe StefanRoettger,et al.  High-Quality Unstructured Volume Rendering on the PC Platform , 2002 .

[7]  Kenneth Moreland,et al.  Tetrahedral projection using vertex shaders , 2002, Symposium on Volume Visualization and Graphics, 2002. Proceedings. IEEE / ACM SIGGRAPH.

[8]  Valerio Pascucci,et al.  Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality , 2002, Comput. Graph. Forum.

[9]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[10]  Nelson L. Max,et al.  Sorting and hardware assisted rendering for volume visualization , 1994, VVS '94.

[11]  Peter Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, SIGGRAPH 1990.

[12]  Joseph S. B. Mitchell,et al.  Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids , 1998, Comput. Graph. Forum.

[13]  George B. Dantzig,et al.  Fourier-Motzkin Elimination and Its Dual , 1973, J. Comb. Theory, Ser. A.

[14]  Wolfgang Straßer,et al.  Interactive rendering of large volume data sets , 2002, IEEE Visualization, 2002. VIS 2002..

[15]  Paolo Cignoni,et al.  Simplification of Tetrahedral meshes with accurate error evaluation , 2000 .

[16]  Arie E. Kaufman,et al.  Multiresolution tetrahedral framework for visualizing regular volume data , 1997 .

[17]  Thomas Ertl,et al.  Fast volumetric display of natural gaseous phenomena , 2003, Proceedings Computer Graphics International 2003.

[18]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[19]  Mark A. Duchaineau,et al.  ROAMing terrain: Real-time Optimally Adapting Meshes , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[20]  Jean-Michel Dischler,et al.  Simulating Fluid-Solid Interaction , 2003, Graphics Interface.

[21]  Valerio Pascucci,et al.  Interactive view-dependent rendering of large isosurfaces , 2002, IEEE Visualization, 2002. VIS 2002..

[22]  A. Barvinok,et al.  An Algorithmic Theory of Lattice Points in Polyhedra , 1999 .