带属性的三角网格模型简化算法研究

Research on Mesh Simplification with Additional Attributes

在计算机视觉、计算机仿真、网络传输中 ,经常遇到带有颜色、纹理等属性的三角网格模型的简化问题 .文中提出一种带属性的三角网格模型简化的算法 ,该算法将表征网格顶点信息的向量由简单的三维几何信息扩展到包含颜色、纹理等附加信息的多维向量 ,在 Rn空间中用对称 Hausdorff距离控制网格简化顺序和精度 ,既保证了简化网格模型在几何上与初始网格模型尽可能地相似 ,又较好地保存了初始网格模型的颜色。

Polyhedral mesh simplification with additional properties (such as color, texture etc.) is often used in computer visualization, computer simulation, mesh transmission etc. Instead of 3 dimensional vector, the algorithm uses n dimensional vector, which contains the information of coordinates, colors, textures etc, to describe the mesh vertex. Symmetric Hausdorff distance in R n space is used to control the error of simplification. The algorithm successfully preserves the color and texture appearance of the original data field and guarantees that the simplified mesh matches well with the original one.