基于向量夹角的三角网格模型简化算法

Triangular mesh simplification algorithm based on vector angle

提出以顶点向量夹角为剔除准则,运用顶点去除方法进行网格简化的算法.该算法首先计算每个网格顶点与其周围相邻顶点所形成的方向向量,然后根据方向向量的平均夹角来识别和简化网格中的平面区域,之后再以该顶点所处区域是否比较平坦为顶点去除限制条件,判断该顶点是否符合安全去除原则,这样可以保留特征顶点,进而保持物体的视觉特征.在顶点去除后,还需要对因此而形成的多边形进行三角形网格重建,以填补空洞.该算法在简化质量和简化速率方面取得了较好的平衡.

The author proposes a 3D triangular mesh simplification algorithm with the method of vertex culling, which is based on the rule of vector angle. This algorithm includes the following steps in turn: calculating direction vectors generated by a random mesh vertex and the ones around it; recognizing and simplifying the planar areas in the mesh according to vector average angle; judging whether a vertex accords with the secure culling rule, which adopts the result whether the area where this vertex lies is smooth as a restraint to reserve the characteristic vertexes and then keep the visual features; after the step of vertex culling, conducting triangular mesh reconstruction on the polygons formed in the above steps to fill up the hollows. This algorithm achieves desirable balance in mesh simplification in the aspects of quality and efficiency.