Isosurfacing in higher dimensions

Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions higher than three. Most algorithms require a sampling in three-dimensions before applying any visualization algorithms. This sampling typically ignores vital features that may be present when examined in oblique cross-sections, and places an undo burden on system resources when animation through additional dimensions is desired. For time-varying data of large data sets, smooth animation is desired at interactive rates. We provide a fast Marching Cubes like algorithm for hypercubes of any dimension. To support this, we have developed a new algorithm to automatically generate the isosurface and triangulation tables for any dimension. This allows the efficient calculation of 4D isosurfaces, which can be interactively sliced to provide smooth animation or slicing through oblique hyperplanes. The former allows for smooth animation in a very compressed format. The latter provide better tools to study time-evolving features as they move downstream. We also provide examples in using this technique to show interval volumes or the sensitivity of a particular isovalue threshold.

[1]  Kurt Mehlhorn,et al.  Four Results on Randomized Incremental Constructions , 1992, Comput. Geom..

[2]  Pheng-Ann Heng,et al.  Visualizing the fourth dimension using geometry and light , 1991, Proceeding Visualization '91.

[3]  Andrew J. Hanson,et al.  Interactive visualization methods for four dimensions , 1993, Proceedings Visualization '93.

[4]  Jane Wilhelms,et al.  Multi-dimensional trees for controlled volume rendering and compression , 1994, VVS '94.

[5]  P. Hanrahan,et al.  Area and volume coherence for efficient visualization of 3D scalar functions , 1990, SIGGRAPH 1990.

[6]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

[7]  Pheng-Ann Heng,et al.  Four-dimensional views of 3D scalar fields , 1992, Proceedings Visualization '92.

[8]  Andrew J. Hanson,et al.  4 Rotations for N-Dimensional Graphics , 1995 .

[9]  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).

[10]  Roger Crawfis,et al.  Efficient subdivision of finite-element datasets into consistent tetrahedra , 1997 .

[11]  Issac J. Trotts,et al.  Simplification of tetrahedral meshes , 1998 .

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

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

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

[15]  Martin J. Dürst,et al.  Re , 1988 .

[16]  G. Nielson,et al.  Interval volume tetrahedrization , 1997 .

[17]  V. Pascucci,et al.  Hypervolume visualization: a challenge in simplicity , 1998, VVS '98.

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

[19]  David C. Banks,et al.  Complex-valued contour meshing , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[20]  I. Fujishiro,et al.  Volumetric Data Exploration Using Interval Volume , 1996, IEEE Trans. Vis. Comput. Graph..