Accelerated Isosurface Extraction in Time-Varying Fields

For large time-varying data sets, memory and disk limitations can lower the performance of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends the three-dimensional branch-on-need octree for time-varying isosurface extraction. This data structure minimizes the impact of the I/O bottleneck by reading from disk only those portions of the search structure and data necessary to construct the current isosurface. By performing a minimum of I/O and exploiting the hierarchical memory found in modern CPUs, the T-BON algorithm achieves high performance isosurface extraction in time-varying fields. The paper extends earlier work on the T-BON data structure by including techniques for better memory utilization, out-of-core isosurface extraction, and support for nonrectilinear grids. Results from testing the T-BON algorithm on large data sets show that its performance is similar to that of the three-dimensional branch-on-need octree for static data sets while providing substantial advantages for time varying fields.

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

[2]  Philip D. Heermann.  Production visualization for the ASCI One TeraFLOPS machine , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[3]  Cláudio T. Silva,et al.  Three dimensional visualization of proteins in cellular interactions , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[4]  Yi-Jen Chiang,et al.  I/O optimal isosurface extraction , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[5]  William E. Lorensen,et al.  Marching cubes: a high resolution 3D surface construction algorithm , 1996 .

[6]  Jean M. Favre.  Towards efficient visualization support for single-block and multi-block datasets , 1997 .

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

[8]  Koji Koyamada,et al.  Volume thinning for automatic isosurface propagation , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[9]  J. Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[10]  David Ellsworth,et al.  Application-controlled demand paging for out-of-core visualization , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[11]  Han-Wei Shen,et al.  A Near Optimal Isosurface Extraction Algorithm Using the Span Space , 1996, IEEE Trans. Vis. Comput. Graph..

[12]  Philip D. Heermann.  Production visualization for the ASCI one TeraFLOPS machine , 1998 .

[13]  William E. Lorensen,et al.  Marching through the Visible Man , 1995, Proceedings Visualization '95.

[14]  William J. Schroeder,et al.  Interactive out-of-core isosurface extraction , 1998 .

[15]  David C. Banks,et al.  Extracting iso-valued features in 4-dimensional scalar fields , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[16]  Han-Wei Shen.  Isosurface extraction in time-varying fields using a temporal hierarchical index tree , 1998 .

[17]  Michael Cox,et al.  Application-controlled demand paging for out-of-core visualization , 1997 .

[18]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[19]  Georgios Sakas,et al.  Optimized Maximum Intensity Projection (MIP) , 1995, Rendering Techniques.

[20]  Koji Koyamada,et al.  Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists , 1995, IEEE Trans. Vis. Comput. Graph..

[21]  Paolo Cignoni,et al.  Speeding Up Isosurface Extraction Using Interval Trees , 1997, IEEE Trans. Vis. Comput. Graph..

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

[23]  David C. Banks,et al.  Extracting iso-valued features in 4-dimensional scalar fields , 1998, VVS '98.

[24]  Karl Heinz Höhne,et al.  High quality rendering of attributed volume data , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[25]  Valerio Pascucci,et al.  Fast isocontouring for improved interactivity , 1996, VVS '96.

[26]  Peter-Pike J. Sloan,et al.  Interactive Ray Tracing for Volume Visualization , 1999, IEEE Trans. Vis. Comput. Graph..

[27]  Jean-Marie Favre.  Towards efficient visualization support for single-block and multi-block datasets , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[28]  Karl Heinz Höhne,et al.  High quality rendering of attributed volume data , 1998 .

[29]  Cláudio T. Silva,et al.  I/O optimal isosurface extraction (extended abstract) , 1997, VIS '97.

[30]  Charles D. Hansen,et al.  Isosurface extraction in time-varying fields using a Temporal Branch-on-Need Tree (T-BON) , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[31]  Charles D. Hansen,et al.  A Case Study of Isosurface Extraction Algorithm Performance , 2000, VisSym.

[32]  Eddy Kuo,et al.  Three-dimensional visualization of microstructures , 1998 .

[33]  Han-Wei Shen,et al.  A Case Study of Isosurface Extraction Algorithm Performance , 2000 .

[34]  Han-Wei Shen,et al.  Isosurface extraction in time-varying fields using a temporal hierarchical index tree , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[35]  Charles D. Hansen,et al.  Isosurfacing in span space with utmost efficiency (ISSUE) , 1996, Proceedings of Seventh Annual IEEE Visualization '96.