一种基于不平滑度的网格简化算法

摘要

在三维建模中，一个物体的网格模型常常包含数以百万计的三角形面片，给模型的存储、绘制、渲染、传输及交互处理带来诸多不便。提出一种三角形折叠法，计算各个顶点的不平滑度，基于顶点不平滑度确定各三角形的权值，并对符合折叠要求的三角形求解折叠后新顶点的位置及累积不平滑度，通过实例验证证明该算法在简化网格时能较好地保持模型整体特征。%In three-dimensional modeling, a 3D mesh model often contains hundreds of millions of triangular facets, which cause a lot of inconvenience to the storage of the model as well as the drawing, rendering, transmission and interactive process-ing of it. This paper proposes a triangle collapsing method, which calculates each vertex’s degree of non-smoothness, deter-mines the weight of each triangle surface and the new vertex’s location and cumulative non-smoothness after a triangle surface is deleted based on the non-smoothness of its three vertices, this paper proves that the method can maintain the geometric charac-teristics in a good way while simplifying a mesh by instance of verification.