浏览全部资源
扫码关注微信
收稿：2017-07-04，
修回：2017-9-24，
纸质出版：2018-04-16
移动端阅览
目的
2
逆向工程中3维扫描数据通常产生孔洞影响逆向造型精度.针对已有算法补洞会导致的边界突变问题，提出基于插值细分和基于径向基函数的孔洞修复算法。
方法
2
首先，对有噪声孔洞边界进行拉普拉斯平滑预处理；其次，通过快速重心插值细分孔洞；然后，结合孔洞周围曲率信息，利用边界和法线约束点进行隐式曲面求解；最后，利用求得的隐式曲面方程，利用梯度下降法调整孔洞插值点，获得平滑修补孔洞结果。
结果
2
对3维经典造型以及实际机械工件等两类不同的数据进行扫描并进行孔洞修补实验。由于算法针对有噪声孔洞结合了孔洞周围曲率信息并通过插值细分进行约束求解，保证了补洞效果的平滑性。实验结果表明，本文算法使得基于径向基函数隐式曲面对有噪声孔洞的适应性更强，其修补结果更加平滑，符合周围曲率变化，改进了已有孔洞修补的边缘突变和修补痕迹明显问题。
结论
2
本文算法针对基于径向基函数的隐式曲面求解对噪声敏感的局限性，进行平滑预处理，结合孔洞周围曲率，提高了孔洞修补效果。由于基于径向基函数的隐式曲面对光顺的流形曲面模拟较好，所以算法对特征孔洞的修补存在一定的不足，快速重心插值法针对不规则孔洞也有一定的局限性。
Objective
2
The development of 3D reconstruction technology has led to the wide application of 3D scanning technology in the cultural relic reconstruction and reverse engineering industries. However
scanning models usually include many holes after reconstruction due to the scanning environment
scanning techniques
and other factors. Models with holes affect follow-up application in the cultural relic reconstruction industry and industrial reverse industry. Radial basis function has been widely used in repairing holes. However
implicit surfaces based on radial basis function are sensitive to noise data. Therefore
they cannot be efficiently used in noise hole filling. This study proposes an improved hole-filling algorithm based on radial basis function. The algorithm mainly consists of smoothing noise data
interpolation subdivision hole structure
and radial basis function. In this way
the proposed algorithm can resolve the boundary mutation problem for noise hole repair.
Method
2
First
the algorithm uses the Laplace function to smooth the boundary of noisy holes. We use the topological structure of adjacent triangles on the model to check the boundary of holes and identify holes. After identifying holes
we smooth their boundary by multiple neighborhoods before building an implicit surface. The algorithm uses the smoothed data to solve the implicit surface on the basis of the radial basis function. Second
the algorithm subdivides the holes by applying the fast center of gravity interpolation method for regular holes. The gravities of boundary and convergence are used to perform a subdivision process. Third
the algorithm combines the curvature features around the holes to make the filling holes consistent features with scanning data. Therefore
boundary and normal constraint points are used to define the implicit surface solution. The boundary constraint points are taken from the multiple neighborhoods from the boundary of holes
and the normal constraint points are taken with the constraint of normal direction. Finally
the algorithm adjusts the interpolation point with the gradient descent method. The points of interpolation subdivision holes are usually not on the scanning surface of the holes. The algorithm uses the obtained implicit surface equation to find the partial derivative to adjust the interpolation points to the scanning surface rapidly. We use the gradient descent method and the setting error threshold to adjust the interpolation points of holes. In this way
we can achieve smooth patch of filling results.
Result
2
3D classical models and actual mechanical workpieces are scanned to verify our algorithm. The comparison experiment is conducted by applying the wave-front method and Geomagic software method to the same holes. Our algorithm uses a preprocessing method for smoothing holes and keeps the curvature features around the holes. An implicit surface based on the radial basis function is applied to ensure the smoothness of repairing holes. The repairing holes become highly consistent with the surrounding curvature. The experimental results show that the proposed algorithm based on radial basis function is adaptable to noise holes. The results of this algorithm are consistent with the curvature variation around the holes. Therefore
the filling results are natural and smooth. The algorithm is a good way to improve the existing problems of edge mutation and trace obvious.
Conclusion
2
The algorithm solves the noise sensitivity problem of implicit surfaces based on radial basis function by the curvature features around holes. However
the results of the algorithm are not ideal for filling some complicated holes. The fast barycentric interpolation function also has limitations for irregular holes.
Davis J, Marschner S R, Garr M, et al. Filling holes in complex surfaces using volumetric diffusion[C]//The First International Symposium on 3D Data Processing Visualization and Transmission, 2002. Padova, Italy: IEEE, 2002: 428-441. [ DOI:10.1109/TDPVT.2002.1024098 http://dx.doi.org/10.1109/TDPVT.2002.1024098 ]
Argudo O, Brunet P, Chica A, et al. Biharmonic fields and mesh completion[J]. Graphical Models, 2015, 82:137-148.[DOI:10.1016/j.gmod.2015.06.010]
Carr J C, Fright W R, Beatson R K. Surface interpolation with radial basis functions for medical imaging[J]. IEEE Transactions on Medical Imaging, 1997, 16(1):96-107.[DOI:10.1109/42.552059]
Du J, Zhang L Y, Wang H T, et al. Hole repairing in triangular meshes based on radial basis function[J]. Journal of Computer-Aided Design&Computer Graphics, 2005, 17(9):1976-1982.
杜佶, 张丽艳, 王宏涛, 等.基于径向基函数的三角网格曲面孔洞修补算法[J].计算机辅助设计与图形学学报, 2005, 17(9):1976-1982. [DOI:10.3321/j.issn:1003-9775.2005.09.014]
Carr J C, Beatson R K, Cherrie J B, et al. Reconstruction and representation of 3D objects with radial basis functions[C]//Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques. New York, NY, USA: ACM, 2001: 67-76. [ DOI:10.1145/383259.383266 http://dx.doi.org/10.1145/383259.383266 ]
Centin M, Pezzotti N, Signoroni A. Poisson-driven seamless completion of triangular meshes[J]. Computer Aided Geometric Design, 2015, 35-36:42-55.[DOI:10.1016/j.cagd.2015.03.006]
Wang X C, Liu X P, Lu L F, et al. Technical section:automatic hole-filling of CAD models with feature-preserving[J]. Computers&Graphics, 2012, 36(2):101-110.[DOI:10.1016/j.cag.2011.12.007]
Liu Z, Wang Y B, Bai L L, et al. Detail-preserving hole-filling for complex 3D models[J]. Journal of Computer-Aided Design&Computer Graphics, 2016, 28(12):2052-2059.
刘震, 王艳宾, 白丽丽, 等.曲面细节特征保持的三维模型孔洞修复方法[J].计算机辅助设计与图形学学报, 2016, 28(12):2052-2059.[DOI:10.3969/j.issn.1003-9775.2016.12.002]
Qiu N N, Fan R, You L H, et al. An efficient and collision-free hole-filling algorithm for orthodontics[J]. The Visual Computer, 2013, 29(6-8):577-586.[DOI:10.1007/s00371-013-0820-6]
Pérez E, Salamanca S, Merchán P, et al. A comparison of hole-filling methods in 3D[J]. International Journal of Applied Mathematics and Computer Science, 2016, 26(4):885-903.[DOI:10.1515/amcs-2016-0063]
Guo X Y, Xiao J, Wang Y. A survey on algorithms of hole filling in 3D surface reconstruction[J]. The Visual Computer, 2016.[DOI:10.1007/s00371-016-1316-y](in press)
Franke R, Nielson G. Smooth interpolation of large sets of scattered data[J]. International Journal for Numerical Methods in Engineering, 1980, 15(11):1691-1704.[DOI:10.1002/nme.1620151110]
Liepa P. Filling holes in meshes[C]//2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing. Aachen, Germany: ACM, 2003: 200-205.
Jin X G, Sun H Q, Peng Q S. Subdivision interpolating implicit surfaces[J]. Computers&Graphics, 2003, 27(5):763-772.[DOI:10.1016/S0097-8493(03)00149-3]
Turk G, O'Brien J F. Modelling with implicit surfaces that interpolate[J]. ACM Transactions on Graphics, 2002, 21(4):855-873.[DOI:10.1145/571647.571650]
相关作者
相关机构
京公网安备11010802024621
