Direct Resampling for Isotropic Surface Remeshing

We present a feature-sensitive remeshing algorithm for relaxation-based methods. The first stage of the algorithm creates a new mesh from scratch by resampling the reference mesh with an exact vertex budget with either uniform or non-uniform vertex distribution according to a density function. The newly introduced samples on the mesh surface are triangulated directly in 3D by constructing a mutual tessellation. The second stage of the algorithm optimizes the positions of the mesh vertices by building a weighted centroidal Voronoi tessellation to obtain a precise isotropic placement of the samples. We achieve isotropy by employing Lloyd’s relaxation method, but other relaxation schemes are applicable. The proposed algorithm handles diverse meshes of arbitrary genus and guarantees that the remeshed model has the same topology as the input mesh. The density function can be defined by the user or derived automatically from the estimated curvature at the mesh vertices. A subset of the mesh edges may be tagged as sharp features to preserve the characteristic appearance of technical models. The new method can be applied to large meshes and produces results faster than previously achievable.

[1]  Martin Isenburg,et al.  Isotropic surface remeshing , 2003, 2003 Shape Modeling International..

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

[3]  Michael S. Floater,et al.  Mean value coordinates , 2003, Comput. Aided Geom. Des..

[4]  Wolfgang Hörmann,et al.  Automatic Nonuniform Random Variate Generation , 2011 .

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

[6]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[7]  Pierre Alliez,et al.  Isotropic Remeshing of Surfaces: A Local Parameterization Approach , 2003, IMR.

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

[9]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[10]  Pedro V. Sander,et al.  Fast triangle reordering for vertex locality and reduced overdraw , 2007, SIGGRAPH 2007.

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

[12]  Grit Thürmer,et al.  Computing Vertex Normals from Polygonal Facets , 1998, J. Graphics, GPU, & Game Tools.

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

[14]  D. Levin,et al.  Optimizing 3D triangulations using discrete curvature analysis , 2001 .

[15]  M. Floater Mean value coordinates , 2003, Computer Aided Geometric Design.

[16]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[17]  Leif Kobbelt,et al.  A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes , 2001, VMV.

[18]  Michael T. Heath,et al.  Feature Detection for Surface Meshes , 2002 .

[19]  Yan Fu,et al.  Direct sampling on surfaces for high quality remeshing , 2009, Comput. Aided Geom. Des..

[20]  Leonidas J. Guibas,et al.  Randomized Incremental Construction of Delaunay and Voronoi Diagrams , 1990, ICALP.