Topology Preserving Tetrahedral Decomposition of Trilinear Cell

We describe a method to decompose a cube with trilinear interpolation into a set of tetrahedra with linear interpolation, where isosurface topology is preserved during decomposition for all isovalues. This method is useful for converting from a rectilinear grid into a tetrahedral grid in scalar data with topological correctness. We apply our method to topologically and geometrically accurate isosurface extraction.

[1]  Valerio Pascucci,et al.  Morse-smale complexes for piecewise linear 3-manifolds , 2003, SCG '03.

[2]  Ken Brodlie,et al.  Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing , 2003, IEEE Trans. Vis. Comput. Graph..

[3]  B. Natarajan.  On generating topologically consistent isosurfaces from uniform samples , 1994, The Visual Computer.

[4]  Jack Snoeyink,et al.  Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization , 2003, VisSym.

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

[6]  Yongjie Zhang,et al.  3D Finite Element Meshing from Imaging Data. , 2005, Computer methods in applied mechanics and engineering.

[7]  Gregory M. Nielson,et al.  Interval volume tetrahedrization , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[8]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.

[9]  Valerio Pascucci,et al.  Morse Complexes for Piecewise Linear 3-Manifolds , 2003 .

[10]  Jack Snoeyink,et al.  Simplicial subdivisions and sampling artifacts , 2001, Proceedings Visualization, 2001. VIS '01..

[11]  Valerio Pascucci,et al.  The contour spectrum , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).