A novel hole patching algorithm for discrete geometry using non‐uniform rational B‐spline
- 2 March 2011
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 87 (13) , 1254-1277
Abstract
A hole patching algorithm for discrete geometry using a parametric approach based on Non‐Uniform Rational B‐Spline (NURBS) curves and surfaces is being presented in this paper. This algorithm is focused on recovering the missing geometric information based on the neighboring points surrounding the topologically simple but geometrically complex holes. The neighboring points are utilized to reconstruct a set of three‐dimensional (3D) NURBS surface patches covering the hole region which in turn are used to produce a smooth surface patch covering the hole. This algorithm can automatically identify the hole, obtain surrounding points, create the NURBS surfaces, and perform the projection of points onto the surface to complete the process. The algorithm also provides a way for the user to control the size and density of triangulation in the patches matching that of the surroundings. This paper describes the algorithm step by step in detail with a test case for description purposes. The validation of the algorithm is performed on several analytical geometries to assess the accuracy of the algorithm. Several complex geometries are used to demonstrate the success and robustness of the algorithm. Finally, a conclusion provides the overall assessment of this research and identifies its weaknesses for future improvements. Copyright © 2011 John Wiley & Sons, Ltd.Keywords
This publication has 18 references indexed in Scilit:
- A Hole-Filling Algorithm for Triangular Meshes Using Local Radial Basis Function2007
- Automatic restoration of polygon modelsACM Transactions on Graphics, 2005
- A piecewise hole filling algorithm in reverse engineeringComputer-Aided Design, 2005
- Robust repair of polygonal modelsACM Transactions on Graphics, 2004
- Interpolating and approximating implicit surfaces from polygon soupACM Transactions on Graphics, 2004
- Dual domain extrapolationACM Transactions on Graphics, 2003
- Simplification and repair of polygonal models using volumetric techniquesIEEE Transactions on Visualization and Computer Graphics, 2003
- Progressive Gap Closing for MeshRepairing2002
- A volumetric method for building complex models from range images1996
- Filling gaps in the boundary of a polyhedronComputer Aided Geometric Design, 1995