基于半边结构的点删除算法研究  

Decimation of Triangle Meshes Based on Half-edge Structure

作　　者：韩军[1] 赵清杰[1] 孙正贵[2] 

机构地区：[1]北京理工大学计算机系,北京100081 [2]胜利石油管理局科技处,东营257017

出　　处：《系统仿真学报》2006年第z1期57-59,62,共4页Journal of System Simulation

基　　金：国家自然科学基金(60543007);理工基础基金(200501F4210)

摘　　要：点删除是一种三角形网格模型化简算法,这篇文章在研究现有的删除算法基础上,对其中存在的一些问题进行了改进。采用半边结构替代原有的数据结构,采用顶点重要度作为选择顶点的一个依据,引入顶点法向作为删除顶点的判断准则,并且对删除后的空洞采用了面扩张算法进行重绘。以人头三维模型为例,通过实验验证了算法的有效性。The decimation of triangle meshes is a kind of mesh simplification algorithms. Based on the existing algorithms, some improvements in several aspects were made. A half-edge structure was used to replace the old structure. The priority of vertexes was adopted as a basis of choosing a vertex. The vertex normal was introduced in the estimation rule, and an expanded triangle was used to re-render a decimated hole. The experiment results on the data of a human's head show the validity of our algorithms.

关 键 词：点删除 半边结构 顶点法向 顶点重要度 

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