Regularized marching cubes mesh

In this paper we revisit the triangulated cubes of the marching cubes algorithm in order to regularize the connectivity of the iso-surface mesh i. e. to maximize the valence six vertices. This leads to both an enhancement of the mesh topology and a significant reduction of the connectivity coding cost. We prove the effectiveness of the approach by processing medical examples with various geometry and topology.

[1]  Rémy Prost,et al.  Remeshing algorithm for multiresolution prior model in segmentation , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[2]  Rémy Prost,et al.  Wavelet-based progressive compression scheme for triangle meshes: wavemesh , 2004, IEEE Transactions on Visualization and Computer Graphics.

[3]  Tony DeRose,et al.  Multiresolution analysis for surfaces of arbitrary topological type , 1997, TOGS.

[4]  Rémy Prost,et al.  Adaptive wavelets based multiresolution modeling of irregular meshes via harmonic maps , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[5]  Rémy Prost,et al.  Wavelet-based multiresolution analysis of irregular surface meshes , 2004, IEEE Transactions on Visualization and Computer Graphics.

[6]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[7]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

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

[9]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[10]  Craig Gotsman,et al.  Explicit Surface Remeshing , 2003, Symposium on Geometry Processing.

[11]  Peter Schröder,et al.  Multiresolution signal processing for meshes , 1999, SIGGRAPH.