可减少模型简化误差的边折叠简化算法及应用

基于三角形网格边折叠简化思想，提出一种基于边顶点重要度简化算法，简化算法能有效保持模型局部特征，减小简化模型和原始模型之间的误差；采用一种改进的三角形网格数据结构，利用二叉树对顶点重要度进行快速排序并记录三角形合并关系，得到所需分辨率下的近似网格模型。数据结构具有层次清楚、操作简单、可扩充性等特点，能有效支持多分辨率简化与快速可视化。

A New Algorithm for Mesh Simplification Based on the Importance of the Vertex

We propose a mesh simplification algorithm based on the importance of the vertex of edge. This algorithm can measure geometric error for surface features. We adopt a kind of data structure-an array structure. During the processing of the mesh simplification, a binary tree is adopted to achieve quick sort.Test demonstrates that this algorithm is simple and efficient; the simplification models have smaller geometric errors than previous works.