Algorithm For Hole-filling Of3D Meshes Based On Feature Enhancement

With the rapid evolution of computer software with hardware and computer graphicstheories,3D meshes has been widely used in film and television animation, virtual reality,medical surgical operation, art manufacturing and other industries as a main data type, speciallyin CAD as well as reverse engineering applications. Reverse engineering using reconstructiontechnique to obtain the complete digital model of the object, and develop new products in a veryshort time with further analysis and processing. Reverse engineering can bring down developcosts and add economic benefits, and it has been perfectly used in surgical operation,archaeological study, computer aided manufacturing and so on. It is urgent to implementhole-filling of the obtained incomplete3D object model and try to restore its original appearance.Therefore,3D mesh model hole-filling research is a work which has theoretical, economic value.Hole-filling algorithm for3D meshes has become one of the hotspot researches, and it isalso an important part of computer visualization, reverse engineering, pattern identification and3D data processing. In this paper, existing hole-filling algorithms for3D mesh model are detaileddescribed and summarized, and an novel hole-filling method is put forward. The major work ofthis paper are as follows:1. We illustrated the background and significance of3D mesh model hole-filling methodresearch and summered its application in computer graphics. We classified existing algorithms totwo ccategories according to different operation objects: based on surface and based on voxel,and explained their main problems.2. Existing3D mode hole-filling algorithms consider only smooth transition of the hole areaand hole edge area while ignoring its original sharp edges and angles during the filling process.By combining and improving existing algorithms, we proposed a new3D model hole-fillingalgorithm upon feature recovery. First, the algorithm will search hole border area of the chosenmesh model automatically and insert discrete points followes by tirangulation in the holepolygon area in order to generate the initial meshes of hole area. Then construct implicit surfacebased on radial basis function in terms of inserted discrete points, and adjust the initial meshes fitto implicit surface. Order to avoid too little constraint points to build oversized implicit surface,we emply layer progressive approach to insert new discrete points, execute tirangulation,construct surfaces and adjust initial meshes to fit implicit surface. Last, implement featureenhancement on mesh based on feature edge and corner recovery to get final result of the repair.The feature edges and corners were recoveride very well.3. Existing hole-filling algorithms mainly aim at flat hole area and do not include highcurvature and rugged hole-filling. Due to the shortcomings of existing methods, we proposed anew hole-filling algorithm based on curvature recovery. The new algorithm executespreprocessing on detected hole polygon border before hole-filling to avoid long or narrowtriangular plates. Fill the hole area using AFM-based minimum angle mechanism which has a lower complexity and adjust the new vertices of hole area in terms of normal vector andcurvature of hole border. Experimental results show that our algorithm can keep hole area andmesh around the border smooth connected, and avoid losing curvature characteristics.