摘要
提出了一种三角网格曲面非均匀精简算法。该算法采用R^＊-tree组织三角网格曲面的空间拓扑结构，实现了三角面片拓扑邻域的快速查询。结合三角网格曲面模型的曲率分布状况，对三角网格曲面进行聚类分簇处理，通过对分簇网格进行局部精简，实现了三角网格曲面模型的整体保形性精简。与同类精简算法的对比实验表明，该算法的数据适应性强，有效地保留了三角网格曲面的型面特征，精简后的网格模型与原网格模型的面片偏差降低了20％～45％，精简时间减少了10％～35％。
A new simplified algorithm for triangular mesh surface is proposed, which organizes the topological structure of the triangular mesh surface based on R^＊-tree spacial index structure to inquire the topological neighborhoods of the triangular mesh surface. Then the triangular mesh surface is discreted into many clusters by the triangular mesh surface features, and the triangular mesh surface is ununiformly simplified throughout the clusters. The stronger adaptability is verified and the features of the triangular mesh surface is remained effectively. It is found that the deviation is reduced by 20%-45%, and the computing period is subtracted by 10%-35% compared with the existing algorithms.
出处
《西安交通大学学报》
EI
CAS
CSCD
北大核心
2008年第9期1179-1183,共5页
Journal of Xi'an Jiaotong University
基金
国家高技术研究发展计划资助项目(2006AA04Z105)
