Interactive Isosurface Ray Tracing of Large Octree Volumes

We present a technique for ray tracing isosurfaces of large compressed structured volumes. Data is first converted into a lossless-compression octree representation that occupies a fraction of the original memory footprint. An isosurface is then dynamically rendered by tracing rays through a min/max hierarchy inside interior octree nodes. By embedding the acceleration tree and scalar data in a single structure and employing optimized octree hash schemes, we achieve competitive frame rates on common multicore architectures, and render large time-variant data that could not otherwise be accommodated

[1]  Marc Levoy,et al.  Efficient ray tracing of volume data , 1990, TOGS.

[2]  Irene Gargantini,et al.  Ray Tracing an Octree: Numerical Evaluation of the First Intersection , 1993, Comput. Graph. Forum.

[3]  Valerio Pascucci,et al.  Encoding volumetric grids for streaming isosurface extraction , 2004 .

[4]  Hanan Samet,et al.  Implementing ray tracing with octrees and neighbor finding , 1989, Comput. Graph..

[5]  Alexander Reshetov,et al.  Multi-level ray tracing algorithm , 2005, ACM Trans. Graph..

[6]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[7]  Roberto Scopigno,et al.  Multiresolution volume visualization with a texture-based octree , 2001, The Visual Computer.

[8]  Philipp Slusallek,et al.  Fast and Accurate Ray-Voxel Intersection Techniques for Iso-Surface Ray Tracing , 2004, VMV.

[9]  Kelvin Sung.  A DDA Octree Traversal Algorithm for Ray Tracing , 1991, Eurographics.

[10]  Charles D. Hansen,et al.  Distributed interactive ray tracing for large volume visualization , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[11]  Hans-Peter Seidel,et al.  Faster isosurface ray tracing using implicit KD-trees , 2005, IEEE Transactions on Visualization and Computer Graphics.

[12]  Kellogg S. Booth,et al.  Report from the chair , 1986 .

[13]  Adam Finkelstein,et al.  Improving progressive view-dependent isosurface propagation , 2002, Comput. Graph..

[14]  Jochen Schwarze.  Cubic and quartic roots , 1990 .

[15]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[16]  Juan Carlos Torres,et al.  Cell Octrees: A New Data Structure for Volume Modeling and Visualization , 2001, VMV.

[17]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[18]  Ronald N. Perry,et al.  Simple and Efficient Traversal Methods for Quadtrees and Octrees , 2002, J. Graphics, GPU, & Game Tools.

[19]  John D. Owens,et al.  Octree textures on graphics hardware , 2005, SIGGRAPH '05.

[20]  Jane Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[21]  Peter-Pike J. Sloan,et al.  Interactive ray tracing for isosurface rendering , 1998 .

[22]  Marc Glisse,et al.  Cost-Optimal Trees for Ray Shooting , 2004, LATIN.

[23]  S.G. Parker,et al.  Design for Parallel Interactive Ray Tracing Systems , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[24]  Markus Wagner,et al.  Interactive Rendering with Coherent Ray Tracing , 2001, Comput. Graph. Forum.

[25]  Adam Finkelstein,et al.  Progressive View-Dependent Isosurface Propagation , 2001, VisSym.

[26]  Charles Hansen,et al.  View dependent isosurface extraction , 1998 .

[27]  Rüdiger Westermann,et al.  Real-time exploration of regular volume data by adaptive reconstruction of isosurfaces , 1999, The Visual Computer.