Surface Segmentation for Improved Remeshing

Many remeshing techniques sample the input surface in a meaningful way and then triangulate the samples to produce an output triangulated mesh. One class of methods samples in a parametrization of the surface. Another class samples directly on the surface. These latter methods must have sufficient density of samples to achieve outputs that are homeomorphic to the input. In many datasets samples must be very dense even in some nearly planar regions due to small local feature size. We present an isotropic remeshing algorithm called κCVT, that achieves topological correctness while sampling sparsely in all flat regions, regardless of local feature size. This is accomplished by segmenting the surface, remeshing the segmented subsurfaces individually and then stitching them back together. We show that κCVT, produces quality meshes using fewer triangles than other methods. The output quality meshes are both homeomorphic and geometrically close to the input surface.

[1]  Tamal K. Dey,et al.  Delaunay Refinement for Piecewise Smooth Complexes , 2007, SODA '07.

[2]  Simon Fuhrmann,et al.  Direct Resampling for Isotropic Surface Remeshing , 2010, VMV.

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

[4]  Qiang Du,et al.  Constrained Centroidal Voronoi Tessellations for Surfaces , 2002, SIAM J. Sci. Comput..

[5]  L. Cohen,et al.  Surface segmentation using geodesic centroidal tesselation , 2004 .

[6]  Marc Pouget,et al.  Estimating differential quantities using polynomial fitting of osculating jets , 2003, Comput. Aided Geom. Des..

[7]  M. Yvinec,et al.  Variational tetrahedral meshing , 2005, SIGGRAPH 2005.

[8]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

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

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

[11]  Chenglei Yang,et al.  On centroidal voronoi tessellation—energy smoothness and fast computation , 2009, TOGS.

[12]  Herbert Edelsbrunner,et al.  Triangulating Topological Spaces , 1997, Int. J. Comput. Geom. Appl..

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

[14]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

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

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

[17]  Houman BOROUCHAKIyUTT,et al.  Surface Mesh Evaluation , 1997 .

[18]  Mark Meyer,et al.  Interactive geometry remeshing , 2002, SIGGRAPH.

[19]  Marco Attene,et al.  Recent Advances in Remeshing of Surfaces , 2008, Shape Analysis and Structuring.

[20]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[21]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.