Feature-First Hole Filling Strategy for 3D Meshes

In this paper we introduce an efficient hole-filling strategy for 3D meshes and at the same time aesthetically recover the sharp features of the original 3D model at the hole areas. Commonly, hole filling techniques try to fill up the hole first then smooth it. Very few have tried to recover the fine features of the original model at the holes. Our hole filling technique is different from other existing techniques as features are taken as the first subject to reconstruct, which eventually drive the feature-definite surface filling process. Feature curves in the missing part are reconstructed by extending salient features of the existing parts. The hole is partitioned into several smaller and more planar sub-holes by the feature curves and then the hole-filling steps are done on those sub-holes. User intervention is allowed to design features to be in desired shape. This indeed guides feature curve reconstruction wherever ambiguity exists or results are unsatisfactory. It is also very efficient as a user is interfering only with sharp features and the actual hole-filling step is dealing with only simple holes.

[1]  Yew-Soon Ong,et al.  Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I , 2005, ICNC.

[2]  Charles K. Chui,et al.  Filling polygonal holes using C1 cubic triangular spline patches , 2000, Comput. Aided Geom. Des..

[3]  Lizhuang Ma,et al.  Feature Sensitive Hole Filling with Crest Lines , 2006, ICNC.

[4]  Szymon Rusinkiewicz,et al.  Eurographics Symposium on Geometry Processing (2005) Atomic Volumes for Mesh Completion , 2022 .

[5]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[6]  Subodh Kumar,et al.  Repairing CAD models , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[7]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[8]  Peter Schröder,et al.  Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing , 2003 .

[9]  David Eppstein,et al.  On triangulating three-dimensional polygons , 1998, Comput. Geom..

[10]  Kuo-Young Cheng,et al.  A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling , 2005, Eurographics.

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

[12]  Wei Zhao,et al.  A Robust Hole-Filling Algorithm for Triangular Mesh , 2007, CAD/Graphics.

[13]  Ashish Myles,et al.  Extending Catmull-Clark Subdivision and PCCM with Polar Structures , 2007 .

[14]  Marc Alexa,et al.  Context-based surface completion , 2004, 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]  Kuo-Young Cheng,et al.  A Sharpness-Dependent Filter for Recovering Sharp Features in Repaired 3D Mesh Models , 2008, IEEE Transactions on Visualization and Computer Graphics.

[17]  H. Seidel,et al.  Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes , 2007 .

[18]  Hans-Peter Seidel,et al.  Fast and robust detection of crest lines on meshes , 2005, SPM '05.

[19]  Vadim Shapiro,et al.  Proceedings of the 2005 ACM symposium on Solid and physical modeling , 2005 .

[20]  Yongtae Jun,et al.  A piecewise hole filling algorithm in reverse engineering , 2005, Comput. Aided Des..

[21]  Xue J. He,et al.  A haptics-guided hole-filling system based on triangular mesh , 2006 .

[22]  H. Seidel,et al.  Multi-level partition of unity implicits , 2003 .