Isotopic approximation within a tolerance volume

We introduce in this paper an algorithm that generates from an input tolerance volume a surface triangle mesh guaranteed to be within the tolerance, intersection free and topologically correct. A pliant meshing algorithm is used to capture the topology and discover the anisotropy in the input tolerance volume in order to generate a concise output. We first refine a 3D Delaunay triangulation over the tolerance volume while maintaining a piecewise-linear function on this triangulation, until an isosurface of this function matches the topology sought after. We then embed the isosurface into the 3D triangulation via mutual tessellation, and simplify it while preserving the topology. Our approach extends to surfaces with boundaries and to non-manifold surfaces. We demonstrate the versatility and efficacy of our approach on a variety of data sets and tolerance volumes.

[1]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[2]  James F. O'Brien,et al.  Interpolating and approximating implicit surfaces from polygon soup , 2004, SIGGRAPH Courses.

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

[4]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[5]  Frédéric Chazal,et al.  Geometric Inference for Measures based on Distance Functions , 2011 .

[6]  Tamal K. Dey,et al.  Tight cocone: a water-tight surface reconstructor , 2003, SM '03.

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

[8]  Frédéric Chazal,et al.  Geometric Inference for Probability Measures , 2011, Found. Comput. Math..

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

[10]  Tamal K. Dey,et al.  Curve and Surface Reconstruction , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

[12]  Frédéric Chazal,et al.  A condition for isotopic approximation , 2004, SM '04.

[13]  Sunghee Choi,et al.  A simple algorithm for homeomorphic surface reconstruction , 2000, SCG '00.

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

[15]  Jean-Daniel Boissonnat,et al.  Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2000, SCG '00.

[16]  Alok Aggarwal,et al.  Finding minimal convex nested polygons , 1985, SCG '85.

[17]  Leif Kobbelt,et al.  Automatic restoration of polygon models , 2005, TOGS.

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

[19]  Michael M. Kazhdan,et al.  Poisson surface reconstruction , 2006, SGP '06.

[20]  Herbert Edelsbrunner,et al.  Topology preserving edge contraction , 1998 .

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

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

[23]  Tao Ju.  Robust repair of polygonal models , 2004, SIGGRAPH 2004.

[24]  Tamal K. Dey,et al.  Eurographics Symposium on Geometry Processing 2009 Isotopic Reconstruction of Surfaces with Boundaries , 2022 .

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

[26]  Reinhard Klein,et al.  Intersection Free Simplification , 2003, Int. J. Shape Model..

[27]  Steve Oudot,et al.  Provably good sampling and meshing of surfaces , 2005, Graph. Model..

[28]  Leif Kobbelt,et al.  Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information , 2006, SGP '06.

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

[30]  Tamal K. Dey,et al.  An Adaptive MLS Surface for Reconstruction with Guarantees , 2022 .

[31]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

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

[33]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[34]  Marco Attene,et al.  A lightweight approach to repairing digitized polygon meshes , 2010, The Visual Computer.

[35]  Leif Kobbelt,et al.  OpenFlipper: An Open Source Geometry Processing and Rendering Framework , 2010, Curves and Surfaces.