Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition

Beginning with digitized volumetric data, we wish to rapidly and efficiently extract and represent surfaces defined as isosurfaces in the interpolated data. The Marching Cubes algorithm is a standard approach to this problem. We instead perform a decomposition of each 8-cell associated with a voxel into five tetrahedra. We guarantee the resulting surface representation to be closed and oriented, defined by a valid triangulation of the surface of the body, which in turn is presented as a collection of tetrahedra. The entire surface is "wrapped" by a collection of triangles, which form a graph structure, and where each triangle is contained within a single tetrahedron. The representation is similar to the homology theory that uses simplices embedded in a manifold to define a closed curve within each tetrahedron. We introduce data structures based upon a new encoding of the tetrahedra that are at least four times more compact than the standard data structures using vertices and triangles. For parallel computing and improved cache performance, the vertex information is stored local to the tetrahedra. We can distribute the vertices in such a way that no tetrahedron ever contains more than one vertex, We give methods to evaluate surface curvatures and principal directions at each vertex, whenever these quantities are defined. Finally, we outline a method for simplifying the surface, that is reducing the vertex count while preserving the geometry. We compare the characteristics of our methods with an 8-cell based method, and show results of surface extractions from CT-scans and MR-scans at full resolution.

[1]  A. Gueziec,et al.  Surface representation with deformable splines: using decoupled variables , 1995 .

[2]  Larry L. Schumaker,et al.  Triangulations in CAGD , 1993, IEEE Computer Graphics and Applications.

[3]  Arthur W. Toga,et al.  Surface mapping brain function on 3D models , 1990, IEEE Computer Graphics and Applications.

[4]  Bernd Hamann,et al.  A data reduction scheme for triangulated surfaces , 1994, Comput. Aided Geom. Des..

[5]  Bernd Hamann,et al.  Modeling contours of trivariate data , 1992 .

[6]  Mark Hall,et al.  Adaptive polygonalization of implicitly defined surfaces , 1990, IEEE Computer Graphics and Applications.

[7]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[8]  Olivier D. Faugeras,et al.  From partial derivatives of 3-D density images to ridge lines , 1992, Other Conferences.

[9]  David Dean,et al.  The wrapper: a surface optimization algorithm that preserves highly curved areas , 1994, Other Conferences.

[10]  Marilyn E. Noz,et al.  Constructing topologically connected surfaces for the comprehensive analysis of 3-D medical structures , 1991, Medical Imaging.

[11]  A Koide,et al.  Polyhedral approximation approach to molecular orbital graphics , 1986 .

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

[13]  Bruce G. Baumgart,et al.  Geometric modeling for computer vision. , 1974 .

[14]  Paul Ning,et al.  An evaluation of implicit surface tilers , 1993, IEEE Computer Graphics and Applications.

[15]  Akio Koide,et al.  An Efficient Method of Triangulating Equi-Valued Surfaces by Using Tetrahedral Cells , 1991 .

[16]  Åke Wallin,et al.  Constructing isosurfaces from CT data , 1991, IEEE Computer Graphics and Applications.

[17]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[19]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[20]  Daniel B. Karron.  SpiderWeb algorithm for surface construction in noisy volume data (Proceedings Only) , 1992, Other Conferences.

[21]  Russell H. Taylor,et al.  Superfaces: polyhedral approximation with bounded error , 1994, Medical Imaging.

[22]  Alan Kalvin,et al.  Segmentation and Surface-Based Modeling Objects in Three-Dimensional Biomedical Images , 1991 .

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

[24]  Nicholas Ayache,et al.  Evaluating 3D registration of CT-scan images using crest lines , 1993, Optics & Photonics.

[25]  Bernd Hamann,et al.  Curvature Approximation for Triangulated Surfaces , 1993, Geometric Modelling.