摘要： 在计算机的图形应用中常会产生由大量三角形构成的几何模型。作者提供一种算法以减少三角形数却又能保持其拓扑结构。此算法首先遍历整个几何模型的表面,得到一组潜在可删除的顶点集,然后从整体上对这些顶点进行控制并适当删除,从而简化整个网格结构。

关键词: 判断平面, 潜在可删除点集, 支撑平面, 面片, 边界

Abstract: In computer graphics application, the geometric models made up of a large amount of triangles are generated, so that they become the heavy burden for computer system.Here, we present an algorithm which can reduce the number of triangles while preserving global topology. This algorithm traverses the entire surface of the mesh at first and gets a set of potentially-erasable vertices. Under the control of constraints, we delete some of them for sure that the destination mesh is the approximation to the original one under error-tolerance . After that, we get the simplified one.

中图分类号: 

• TP391.4