Two Simple Methods for Improving a Triangle Mesh Surface

We present two simple and efficient local methods that reposition vertices of a triangle mesh surface with the goal of producing good triangle shapes while preserving the enclosed volume and sharp features. The methods involve minimizing a quadratic energy functional with respect to variations in a tangent plane (or in the direction of a crease) at each free vertex. One of the methods is aimed at producing uniform angles, while the other method is designed to produce uniform triangle areas, or more generally, to force relative triangle areas to conform to curvature estimates or estimates of local feature size so that vertex density is low in flat spots and relatively high in regions of large curvature. Test results demonstrate the effectiveness of both methods, especially when combined.

[1]  Hao Zhang,et al.  Delaunay mesh construction , 2007, Symposium on Geometry Processing.

[2]  Timothy S Newman,et al.  An angle-based optimization approach for 2D finite element mesh smoothing , 2006 .

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

[4]  Joonki Paik,et al.  Normal Vector Voting: Crease Detection and Curvature Estimation on Large, Noisy Meshes , 2002, Graph. Model..

[5]  D. A. Field Laplacian smoothing and Delaunay triangulations , 1988 .

[6]  Michael J. Holst,et al.  Feature-preserving surface mesh smoothing via suboptimal Delaunay triangulation , 2013, Graph. Model..

[7]  Tamal K. Dey,et al.  Delaunay Mesh Generation , 2012, Chapman and Hall / CRC computer and information science series.

[8]  Zeyun Yu,et al.  Quality mesh smoothing via local surface fitting and optimum projection , 2011, Graph. Model..

[9]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[10]  Charles L. Lawson,et al.  Transforming triangulations , 1972, Discret. Math..

[11]  Chandrajit L. Bajaj,et al.  Surface Smoothing and Quality Improvement of Quadrilateral/Hexahedral Meshes with Geometric Flow , 2005, IMR.

[12]  Ming C. Lin,et al.  Example-guided physically based modal sound synthesis , 2013, ACM Trans. Graph..

[13]  Marshall W. Bern,et al.  A new Voronoi-based surface reconstruction algorithm , 1998, SIGGRAPH.

[14]  Kenji Shimada,et al.  An Angle-Based Approach to Two-Dimensional Mesh Smoothing , 2000, IMR.

[15]  Robert J. Renka,et al.  Minimal Surfaces and Sobolev Gradients , 1995, SIAM J. Sci. Comput..

[16]  Robert J. Renka A trust region method for constructing triangle-mesh approximations of parametric minimal surfaces , 2014 .

[17]  Robert J. Renka,et al.  A Storage-efficient Method for Construction of a Thiessen Triangulation , 1982 .

[18]  Lei He,et al.  Mesh denoising via L0 minimization , 2013, ACM Trans. Graph..

[19]  Tamal K. Dey,et al.  Polygonal surface remeshing with Delaunay refinement , 2010, Engineering with Computers.

[20]  Robert J. Renka,et al.  Mesh improvement by minimizing a weighted sum of squared element volumes , 2015 .

[21]  Marco Attene,et al.  Sharpen&Bend: recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling , 2005, IEEE Transactions on Visualization and Computer Graphics.

[22]  Craig Gotsman,et al.  High quality compatible triangulations , 2004, Engineering with Computers.

[23]  Y. K. Lee,et al.  A New Indirect Anisotropic Quadrilateral Mesh Generation Scheme with Enhanced Local Mesh Smoothing Procedures , 2018 .

[24]  Ligang Liu,et al.  Blue noise sampling of surfaces , 2012, Comput. Graph..

[25]  Touradj Ebrahimi,et al.  MESH: measuring errors between surfaces using the Hausdorff distance , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[26]  Long Chen,et al.  Mesh Smoothing Schemes Based on Optimal Delaunay Triangulations , 2004, IMR.