边界特征保持的网格模型分级二次误差简化算法  

New Quadric Metric for Simplifying Meshes to Retain the Feature Edge

作　　者：易兵[1] 刘振宇[1] 谭建荣[1] 

机构地区：[1]浙江大学CAD8LCG国家重点实验室,杭州310027

出　　处：《计算机辅助设计与图形学学报》2012年第4期427-434,共8页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(51075357);国家“九七三”重点基础研究发展计划项目(2011CB706503);中央高校基本科研业务费专项基金(2010QNA4026)

摘　　要：在参考张量投票理论的基础上,结合二次误差简化算法,提出一种边界特征保持的几何网格模型分级二次误差简化算法.首先根据张量投票理论对三角网格顶点进行面点、边点、角点类型分类;然后对各边对按照二次误差简化算法进行边折叠代价计算;再将分类顶点按照设定的等级权重加入边对折叠代价中,从而保证渐进式简化过程中能够对顶点进行分级简化.实验结果表明,该算法不但能实现渐进简化,而且能按需保留模型的整体特征和细节特征.Using tensor voting theory to classify the vertices in triangle meshes and connecting with the quadric error metric surface simplification algorithm,we presented a new quadric error metric algorithm for simplifying meshes to retain the feature edge of the original model.First,all vertices are classified into a plane,a sharp edge,a corner,according to the tensor voting theory.Then every edge is classified into several types,each type with a level weight.And the level weight is added into the cost of contracting pair in the quadric error metric surface simplification algorithm.Finally,iteratively removing the edge pair,a feature edge retained progressive meshes are generated.The empirical results show that the proposed algorithm is able to retain the overall characteristic features and small details of the original model.

关 键 词：张量投票理论 顶点分类 网格简化 渐进网格 

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