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.