一种新型的感知逼真的渐进网格简化算法  

Novel Progressive Mesh Simplification Algorithm with Perceptible Fidelity

作　　者：李亮[1] 程志全[1] 金士尧[1] 

机构地区：[1]国防科技大学计算机学院PDL重点实验室,湖南长沙410073

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

基　　金：湖南省自然科学基金(05JJ30124)

摘　　要：网格简化是计算机图形学中一个传统的研究课题,它对网格的存储和传输处理以及实时绘制都有着重要的意义。在视觉感知理论的指导下,提出一种新型的渐进网格简化算法,在简化过程中尽量保持视觉敏感的区域。依据半边折叠的能量函数来有效控制几何误差。实验表明,此算法不但可以生成一系列感知逼真的细节等级模型,而且具有很好的时间复杂性。Mesh simplification is a classical research subject in computer graphics and is an very important significance for mesh storage, transmission process and real time render. In accordance with human vision theory, a new progressive mesh simplification algorithm was proposed. In the process of simplification, this algorithm keeps the most vision sensitive area. According to the energy function of half-edge collapse, this algorithm can effectively reduce geometry error. Experiment proves that this algorithm can generate a series of LOD (level of detail) model with perceptible fidelity and low time complexity.

关 键 词：曲率 轮廓保持 半边折叠 网格简化 

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