Wavelet-based polygon soup consolidation

Abstract In this paper, a robust consolidation method based on wavelets is presented for the defective polygonal mesh even polygon soup. The indicator function of a model is represented with wavelets, where the wavelet coefficients are computed by surface integrals over polygons. The hierarchical wavelet representation from defective inputs guarantees a consolidated surface extracted from it where orthogonal and compactly supported D4 Daubechies wavelets are employed to balance the efficiency and surface quality. We investigate the usage of the wavelet representation in various geometric operations in 3D, such as data compression, repairing, Boolean operation, denoising, etc. Experiments demonstrate that the method is effective in polygon soup consolidation.

[1]  Scott Schaefer,et al.  Dual marching cubes: primal contouring of dual grids , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[2]  O. J. Marlowe,et al.  Numerical integration over simplexes and cones , 1956 .

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

[4]  Jakob Andreas Bærentzen,et al.  Pseudo-Normals for Signed Distance Computation , 2003, VMV.

[5]  Charlie C. L. Wang,et al.  Quasi-interpolation for surface reconstruction from scattered data with radial basis function , 2012, Comput. Aided Geom. Des..

[6]  Yutaka Ohtake,et al.  Hierarchical error-driven approximation of implicit surfaces from polygonal meshes , 2006, SGP '06.

[7]  Hongyi Xu,et al.  Signed distance fields for polygon soup meshes , 2014, Graphics Interface.

[8]  David L. Marcum,et al.  Stitching and Filling: Creating Conformal Faceted Geometry , 2005, IMR.

[9]  Bruno Lévy.  Dual domain extrapolation , 2003, ACM Trans. Graph..

[10]  Jakob Andreas Bærentzen,et al.  3D distance fields: a survey of techniques and applications , 2006, IEEE Transactions on Visualization and Computer Graphics.

[11]  Fabian Beck,et al.  Visualizing the Evolution of Communities in Dynamic Graphs , 2015, Comput. Graph. Forum.

[12]  Steve Marschner,et al.  Filling holes in complex surfaces using volumetric diffusion , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

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

[14]  Josiah Manson,et al.  Streaming Surface Reconstruction Using Wavelets , 2008, Comput. Graph. Forum.

[15]  Charlie C. L. Wang,et al.  Bilateral recovering of sharp edges on feature-insensitive sampled meshes , 2006, IEEE Transactions on Visualization and Computer Graphics.

[16]  Bailin Deng,et al.  Guided Mesh Normal Filtering , 2015, Comput. Graph. Forum.

[17]  Michael M. Kazhdan,et al.  Reconstruction of solid models from oriented point sets , 2005, SGP '05.

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

[19]  Chang-Hun Kim,et al.  Analytic Solutions of Integral Moving Least Squares for Polygon Soups , 2012, IEEE Transactions on Visualization and Computer Graphics.

[20]  Xiaogang Jin,et al.  Implicit modeling from polygon soup using convolution , 2008, The Visual Computer.

[21]  D. Cohen-Or,et al.  Context-based surface completion , 2004, SIGGRAPH 2004.

[22]  Carlos Andújar,et al.  Mesh repair with user-friendly topology control , 2011, Comput. Aided Des..

[23]  Marco Attene,et al.  Polygon mesh repairing: An application perspective , 2013, CSUR.

[24]  Charlie C. L. Wang,et al.  Layer Depth-Normal Images for Complex Geometries: Part One — Accurate Modeling and Adaptive Sampling , 2008 .

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

[26]  Tao Ju,et al.  Fixing Geometric Errors on Polygonal Models: A Survey , 2009, Journal of Computer Science and Technology.

[27]  Greg Turk,et al.  Robust Creation of Implicit Surfaces from Polygonal Meshes , 2002, IEEE Trans. Vis. Comput. Graph..

[28]  Jakob Andreas Bærentzen,et al.  Signed Distance Computation Using the Angle Weighted Pseudonormal , 2005, IEEE Trans. Vis. Comput. Graph..

[29]  Alexander A. Pasko,et al.  Convolution Filtering of Continuous Signed Distance Fields for Polygonal Meshes , 2015, Comput. Graph. Forum.

[30]  Alberto Signoroni,et al.  Poisson-driven seamless completion of triangular meshes , 2015, Comput. Aided Geom. Des..

[31]  Yasushi Ito,et al.  A Hole-filling Algorithm Using Non-uniform Rational B-splines , 2007, IMR.

[32]  Dinesh Manocha,et al.  Efficient Boundary Extraction of BSP Solids Based on Clipping Operations , 2013, IEEE Transactions on Visualization and Computer Graphics.

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

[34]  Harlen Costa Batagelo,et al.  Generalized Hermitian Radial Basis Functions Implicits from polygonal mesh constraints , 2013, The Visual Computer.