ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes

Polygonal meshes obtained from acquisition of real-world objects may easily exhibit topological or geometrical defects, which often prevent subsequent processing and analysis to provide satisfactory results. This paper describes the foundations of ReMESH, a user-friendly graphical tool which incorporates several mesh-repairing features, and allows to perform a kind of low-level editing which is often missing in most existing software packages. We show how state-of-the-art techniques have been adapted and extended to form an intuitive and integrated environment, and introduce some optimizations and novel ideas that make ReMESH particularly efficient. The main application in which the tool proves to be extremely useful is the post-processing of scanned surface models. In this context, ReMESH represents a valid support for the production of certified quality meshes

[1]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[2]  Leonidas J. Guibas,et al.  Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.

[3]  Marcin Novotni,et al.  Progressive Gap Closing for MeshRepairing , 2002 .

[4]  Steven Fortune,et al.  Robustness Issues in Geometric Algorithms , 1996, WACG.

[5]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[6]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[7]  David Eppstein,et al.  On triangulating three-dimensional polygons , 1996, SCG '96.

[8]  Gabriel Taubin,et al.  Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces , 2001, IEEE Trans. Vis. Comput. Graph..

[9]  Jarek Rossignac,et al.  Matchmaker: manifold BReps for non-manifold r-sets , 1999, SMA '99.

[10]  Paolo Cignoni,et al.  Marching intersections: an efficient resampling algorithm for surface management , 2001, Proceedings International Conference on Shape Modeling and Applications.

[11]  Leila De Floriani,et al.  Representation of Non-manifold Objects Through Decomposition into Nearly Manifold Parts , 2003 .

[12]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[13]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[14]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[15]  Marco Attene,et al.  Edge-Sharpener: Recovering Sharp Features in Triangulations of non-adaptively re-meshed surfaces , 2003, Symposium on Geometry Processing.

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

[17]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[18]  Tao Ju,et al.  Robust repair of polygonal models , 2004, ACM Trans. Graph..

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

[20]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[21]  Zoë J. Wood,et al.  Topological Noise Removal , 2001, Graphics Interface.

[22]  Peter Liepa,et al.  Filling Holes in Meshes , 2003, Symposium on Geometry Processing.

[23]  Micha Sharir,et al.  Filling gaps in the boundary of a polyhedron , 1995, Comput. Aided Geom. Des..