Multiple material marching cubes algorithm

The accurate reconstruction of three‐dimensional (3D) boundary surfaces from two‐dimensional (2D) medical images is a crucial procedure in most applications of computational biomedical engineering. This paper addresses an innovative system that efficiently reconstructs accurate, multiple‐material, 3D surface meshes from 2D medical images. It is based on an enhanced marching cubes algorithm, the multi‐material marching cubes algorithm (M3C), which extracts boundary surfaces between different materials within one sweep of the image stack in an integrated manner. The continuity and integrity of the surfaces are ensured with this robust algorithm. Surface adjustment algorithms were also revised to adapt to the multiple‐material nature of the system. Copyright © 2003 John Wiley & Sons, Ltd.

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

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

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

[4]  S. Canann,et al.  Optismoothing: an optimization-driven approach to mesh smoothing , 1993 .

[5]  Sergey V. Matveyev.  Approximation of isosurface in the Marching Cube: ambiguity problem , 1994, Proceedings Visualization '94.

[6]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[7]  Robert A. Hummel,et al.  Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition , 1995, IEEE Trans. Vis. Comput. Graph..

[8]  Carl Erikson,et al.  Polygonal Simplification: An Overview , 1996 .

[9]  Roni Yagel,et al.  Octree-based decimation of marching cubes surfaces , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[10]  David Eppstein,et al.  Optimal point placement for mesh smoothing , 1997, SODA '97.

[11]  Laurent Lucas,et al.  A new unsupervised cube-based algorithm for iso-surface generation , 1997, Comput. Networks ISDN Syst..

[12]  Enrico O. Purisima,et al.  A new tetrahedral tesselation scheme for isosurface generation , 1998, Comput. Graph..

[13]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[14]  Jianping Li,et al.  An efficiency enhanced isosurface generation algorithm for volume visualization , 1998, The Visual Computer.

[15]  Andrew H. Gee,et al.  Regularised marching tetrahedra: improved iso-surface extraction , 1999, Comput. Graph..

[16]  Heinrich Müller,et al.  Improved Laplacian Smoothing of Noisy Surface Meshes , 1999, Comput. Graph. Forum.

[17]  Leif Kobbelt,et al.  Geometric fairing of irregular meshes for free-form surface design , 2001, Comput. Aided Geom. Des..