Aliasing-free simplification of surface meshes

We propose in this paper a robust simplification technique, which preserves geometric features such as sharp edges or corners from original surfaces. To achieve this goal, our simplification process relies on a detection tool that enables to preserve the sharp features during the three subsequent steps: a Poisson disk sampling that intelligently reduces the number of vertices of the initial mesh; the meshing of the samples that aligns the edges along the feature lines; and a constrained relaxation step that improves the shape of the triangles of our final simplified mesh. Experimental results show that our method always produces valid meshes without aliasing artifacts, and without giving up the shape fidelity and quality of the mesh elements.

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

[2]  Shi-Qing Xin,et al.  Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation , 2011, 2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering.

[3]  Ares Lagae,et al.  A procedural object distribution function , 2005, TOGS.

[4]  Dong-Ming Yan,et al.  Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram , 2009, Comput. Graph. Forum.

[5]  Laurent D. Cohen,et al.  Geodesic Remeshing Using Front Propagation , 2003, International Journal of Computer Vision.

[6]  Marc Antonini,et al.  Adaptive semi-regular remeshing: A Voronoi-based approach , 2010, 2010 IEEE International Workshop on Multimedia Signal Processing.

[7]  J. Sethian,et al.  Fast Voronoi Diagrams and Offsets on Triangulated Surfaces , 2000 .

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

[9]  Rui Wang,et al.  Fast, realistic lighting and material design using nonlinear cut approximation , 2008, SIGGRAPH Asia '08.

[10]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[11]  Kwan H. Lee,et al.  Feature detection of triangular meshes based on tensor voting theory , 2009, Comput. Aided Des..

[12]  David P. Luebke,et al.  A Developer's Survey of Polygonal Simplification Algorithms , 2001, IEEE Computer Graphics and Applications.

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Rémy Prost,et al.  Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams , 2008, IEEE Transactions on Visualization and Computer Graphics.

[15]  Marc Antonini,et al.  Feature-preserving Direct Blue Noise Sampling for Surface Meshes , 2013, Eurographics.

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

[17]  Yan Fu,et al.  Direct sampling on surfaces for high quality remeshing , 2008, SPM '08.