中文摘要：

提出一种基于网格边的光滑度计算来进行Catmull-Clark自适应细分的新算法。该方法能够在满足显示需求的前提下较好地减小细分曲面过程中的网格生成数,同时解决了由于采用网格顶点曲率计算,来实现自适应细分方法中平均化生成顶点曲率带来的不足。通过对比试验,算法能更好地区别当前细分网格中光滑与非光滑区域,增加对非光滑区域网格加密密度,并且该算法能够普遍适用于较复杂的细分模式中,具有一定的推广价值。

英文摘要：

A new algorithm of adaptive subdivision on Catmull-Clark surface with mesh edge-based smooth value is presented in this paper.The method can decrease the number of meshes in surface subdividing steps efficiently while satisfy the demand of display,and solve the shortcoming incurred from adopting the calculation of vertex curvature of mesh to accomplish the average generation of vertex curvature in adaptive subdivision algorithm.Through the contrasting experiment with other Catmull-clark adaptive subdivision schemes,the new algorithm can distinguish the smooth and non-smooth region parts in current subdivided meshes better and increases the density of the meshes in non-smooth region.Moreover,this algorithm is able to be universally applied in quite complicated subdivision pattern and has a certain generalisation value.