基于边顶点重要度的网格简化算法及应用  

An Algorithm for Mesh Simplification Based on the Importance of Vertex and Its Application

作　　者：王健[1] 何明一[1] 

机构地区：[1]西北工业大学电子工程系,陕西西安710072

出　　处：《计算机应用研究》2004年第4期243-245,共3页Application Research of Computers

基　　金：国家自然科学基金(60172040)

摘　　要：基于三角形网格边折叠简化思想,提出一种基于边顶点重要度简化算法,采用一种改进的三角形网格数据结构,在预处理中利用二叉树对顶点重要度进行快速排序并记录三角形合并关系,得到所需分辨率下的近似网格模型。An algorithm for triangle mesh simplification based on the importance of vertex of edge is introduced. According to the analysis of the treated mesh data, a new kind of data structure is adopted. During the processing of the mesh simplification, a binary tree is proposed not only to achieve quick sort but also to record triangle unite.

关 键 词：网格简化 边折叠 重要度 多分辨率 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]