Structure‐Aware Mesh Decimation

We present a novel approach for the decimation of triangle surface meshes. Our algorithm takes as input a triangle surface mesh and a set of planar proxies detected in a pre‐processing analysis step, and structured via an adjacency graph. It then performs greedy mesh decimation through a series of edge collapse, designed to approximate the local mesh geometry as well as the geometry and structure of proxies. Such structure‐preserving approach is well suited to planar abstraction, i.e. extreme decimation approximating well the planar parts while filtering out the others. Our experiments on a variety of inputs illustrate the potential of our approach in terms of improved accuracy and preservation of structure.

[1]  Dinesh Manocha,et al.  Successive Mappings: An Approach to Polygonal Mesh Simplification with Guaranteed Error Bounds , 2003, Int. J. Comput. Geom. Appl..

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

[3]  Sébastien Valette,et al.  Mesh Simplification Using a Two-Sided Error Minimization , 2012 .

[4]  Leif Kobbelt,et al.  Resampling Feature and Blend Regions in Polygonal Meshes for Surface Anti‐Aliasing , 2001, Comput. Graph. Forum.

[5]  André Lieutier,et al.  Efficient data structure for representing and simplifying simplicial complexes in high dimensions , 2011, SoCG '11.

[6]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[7]  Daniel Cohen-Or,et al.  Structure-aware shape processing , 2013, Eurographics.

[8]  Paolo Cignoni,et al.  Multiresolution decimation based on global error , 1996, The Visual Computer.

[9]  A. Guéziec Surface simplification inside a tolerance volume , 1996 .

[10]  David Bommes,et al.  GPU-based tolerance volumes for mesh processing , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[11]  Russell H. Taylor,et al.  Superfaces: polygonal mesh simplification with bounded error , 1996, IEEE Computer Graphics and Applications.

[12]  Niloy J. Mitra,et al.  Abstraction of man-made shapes , 2009, ACM Trans. Graph..

[13]  Reinhard Klein,et al.  Efficient RANSAC for Point‐Cloud Shape Detection , 2007, Comput. Graph. Forum.

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

[15]  Pierre Alliez,et al.  Variational shape approximation , 2004, ACM Trans. Graph..

[16]  Jung Hong Chuang Level of Detail for 3D Graphics , 2002 .

[17]  Jean-Philippe Pons,et al.  Towards high-resolution large-scale multi-view stereo , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[18]  Peter Lindstrom,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[19]  Alexandre Boulch,et al.  Piecewise‐Planar 3D Reconstruction with Edge and Corner Regularization , 2014, Comput. Graph. Forum.

[20]  Leif Kobbelt,et al.  Automatic Generation of Structure Preserving Multiresolution Models , 2005, Comput. Graph. Forum.

[21]  Peter Lindstrom,et al.  Evaluation of Memoryless Simplification , 1999, IEEE Trans. Vis. Comput. Graph..

[22]  H. Borouchaki,et al.  Simplification of surface mesh using Hausdorff envelope , 2005 .

[23]  Florent Lafarge,et al.  Creating Large-Scale City Models from 3D-Point Clouds: A Robust Approach with Hybrid Representation , 2012, International Journal of Computer Vision.

[24]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.

[25]  Reinhard Klein,et al.  Completion and Reconstruction with Primitive Shapes , 2009, Comput. Graph. Forum.

[26]  Michael Garland,et al.  Permission grids: practical, error-bounded simplification , 2002, TOGS.