Edge Transformations for Improving Mesh Quality of Marching Cubes

Marching Cubes is a popular choice for isosurface extraction from regular grids due to its simplicity, robustness, and efficiency. One of the key shortcomings of this approach is the quality of the resulting meshes, which tend to have many poorly shaped and degenerate triangles. This issue is often addressed through post processing operations such as smoothing. As we demonstrate in experiments with several datasets, while these improve the mesh, they do not remove all degeneracies, and incur an increased and unbounded error between the resulting mesh and the original isosurface. Rather than modifying the resulting mesh, we propose a method to modify the grid on which Marching Cubes operates. This modification greatly increases the quality of the extracted mesh. In our experiments, our method did not create a single degenerate triangle, unlike any other method we experimented with. Our method incurs minimal computational overhead, requiring at most twice the execution time of the original Marching Cubes algorithm in our experiments. Most importantly, it can be readily integrated in existing Marching Cubes implementations, and is orthogonal to many Marching Cubes enhancements (particularly, performance enhancements such as out-of-core and acceleration structures).

[1]  Jane Wilhelms,et al.  Topological considerations in isosurface generation , 1994, TOGS.

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

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

[4]  Klaus Gärtner,et al.  Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations , 2005, IMR.

[5]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

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

[7]  Jonathan Richard Shewchuk,et al.  Isosurface stuffing: fast tetrahedral meshes with good dihedral angles , 2007, ACM Trans. Graph..

[8]  Charles Hansen,et al.  The Visualization Handbook , 2011 .

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

[10]  Gregory M. Nielson,et al.  Dual marching cubes , 2004, IEEE Visualization 2004.

[11]  Cláudio T. Silva,et al.  High-Quality Extraction of Isosurfaces from Regular and Irregular Grids , 2006, IEEE Transactions on Visualization and Computer Graphics.

[12]  Hang Si,et al.  On Refinement of Constrained Delaunay Tetrahedralizations , 2006, IMR.

[13]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm , 1980, SIGGRAPH '80.

[14]  Jayaram K. Udupa,et al.  Surface Shading in the Cuberille Environment , 1985, IEEE Computer Graphics and Applications.

[15]  Xavier Tricoche,et al.  Interactive point-based isosurface extraction , 2004, IEEE Visualization 2004.

[16]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[17]  Thomas Theußl,et al.  Isosurfaces on Optimal Regular Samples , 2003, VisSym.

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

[19]  Jonathan Richard Shewchuk,et al.  What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures , 2002, IMR.

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

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

[22]  David E. Breen,et al.  Fast extraction of adaptive multiresolution meshes with guaranteed properties from volumetric data , 2001, Proceedings Visualization, 2001. VIS '01..

[23]  Paul S. Heckbert,et al.  Using particles to sample and control implicit surfaces , 1994, SIGGRAPH.

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

[25]  Jack Snoeyink,et al.  Artifacts caused by simplicial subdivision , 2006, IEEE Transactions on Visualization and Computer Graphics.

[26]  Gabriel Taubin,et al.  Volume warping for adaptive isosurface extraction , 2002, IEEE Visualization, 2002. VIS 2002..

[27]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[28]  Thomas Lewiner,et al.  Efficient Implementation of Marching Cubes' Cases with Topological Guarantees , 2003, J. Graphics, GPU, & Game Tools.

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

[30]  Gabor Herman,et al.  Display of 3-D Digital Images: Computational Foundations and Medical Applications , 1983, IEEE Computer Graphics and Applications.

[31]  Patricia Crossno,et al.  Isosurface extraction using particle systems , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[32]  Tao Ju,et al.  Manifold Dual Contouring , 2007, IEEE Transactions on Visualization and Computer Graphics.

[33]  LeeAnn Tzeng Warping cubes: better triangles from marching cubes , 2004 .

[34]  Timothy J. Baker,et al.  A Comparison Of Triangle Quality Measures , 2001, IMR.

[35]  Luiz Velho,et al.  Physically-based methods for polygonization of implicit surfaces , 1992 .

[36]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..