保持特征的网格修补

提出了一种恢复缺失尖锐特征的网格修补算法。首先对网格顶点建立自适应的八叉树，采用分段二次多项式对网格空洞周围顶点进行拟合。而在尖锐特征处周围，则采用两个或者多个系数不同的二次多项式函数，分别进行拟合，从而获取原始网格所在曲面的尖锐特征边和角。利用扩展的Marching Cube方法获得空洞处的三角网格面片，并和原始网格模型缝合。最后，对于空洞处的网格面片，进行增强特征处理，消除锯齿状网格，获得清晰的尖锐特征。实验结果表明，该方法达到了预期的良好效果。

Feature-preserving Mesh Completion

A feature-preserving mesh completion algorithm is proposed. Firstly the octree-based subdivision of mesh vertices is created. Piecewise quadratic polynomial functions are used to fit the mesh vertices near the hole. Around the sharp features, two or more quadratic functions with different coefficients are used so as to capture sharp features such as edges or corners. The extended Marching Cube algorithm extracts the triangle mesh patch which is stitched to the hole boundary of the original model to complete the polygon mesh. Finally a feature enhancement process is applied to eliminate the aliasing artifacts to obtain fine sharp features. The results of experimental tests show that excellent hole repairing mesh can be achieved.