网格简化算法研.pdf

网格简化算法研究 摘 要 多边形几何模型变得越来越复杂，这无疑给三维物体的实时绘制带来不便， 于是网格简化算法成为目前计算机图形学领域的重点研究之一，它以算法简化 速度、数据结构存储的有效性、误差控制等作为衡量标准，在最大减少物体网 格数的同时也尽量减少原模型细节的损失，本文在前人算法研究的基础上将保 持模型的重要外形特征作为算法简化的因素展开研究，且对 QEM 算法改进。 文章首先概述网格简化算法的研究历史、现状以及主要分类，同时对各类 经典网格简化算法进行详细的介绍，概述每个算法的简化步骤、基本原理，总 结算法的适用范围。接着提出一种保持模型外形特征的网格简化算法，该算法 将网格顶点的曲率值以及边的坍塌值作为参数掺入到算法实现过程中，使算法 具有存储结构简单，参数计算直观有效的特点。最后，论文对基于二次误差测 度的网格简化算法（QEM ）进行深入研究，提出顶点细节度的概念并对该算法 进行改进，有效地克服了 QEM 算法在近视点过于均匀的缺点，改进后的算法 更符合实际需求，简化质量更高。 关键词： 网格简化；外形特征；坍塌值；细节度 Research on Mesh Simplification Algorithm Abstract Polygon geometrical model becomes more and more complex, which makes it difficult to render these 3D models in real-time. Mesh simplification turns to be one of the hottest research area of Computer Graphics. Recently, simplification speed, effectiveness and error control are mesh simplification’s references, which can reduce model complexity and maintain the shape feature of models. On the basis of prevenient research efforts, this dissertation proposed an algorithm of keeping appearance characteristic and made an improvement of QEM. Firstly, we summarized mesh simplification research history, actuality and categories. Later, classical simplification algorithms was introduced and summarized. Then we proposed a mesh simplification algorithm that has notable feature of keeping the appearance characteristic of model during simplification process. Vertex curvature and side collapse value are important factors during the process of simplification, which made the algorithm’s store structure simple and parameter compute effectively; Finally, we made a further research into QEM mesh simplification algorithms