基于半边结构和3^(1/2)细分的渐进网格生成方法  

√Progressive Mesh Generating Method Based on Half-Edge Structure and 3^(1/2) Subdivision

作　　者：马建平[1] 柴毅[1] 陈渤[2] 徐家园[1] 陈强 

机构地区：[1]浙江工业大学计算机科学与技术学院,杭州310023 [2]浙江商业职业技术学院应用工程学院,杭州310053 [3]广东第二师范学院计算机科学系,广州510303

出　　处：《计算机系统应用》2017年第11期238-242,共5页Computer Systems & Applications

基　　金：国家自然基金(61640222,61772140);广东科技计划项目(2017A010101021);广州市科技计划项目(201604010049)

摘　　要：渐进网格可以满足生成多分辨率模型的需求.在现有渐进网格生成方法中,一个顶点的简化往往关联四个以上的相邻顶点.并且,现有方法多采用网格的点面列表结构表示.本文采用3^(1/2)细分预测方法生成渐进网格,每个顶点的存储仅关联三个相邻顶点.同时也使用半边数据结构替代网格的点面列表表示形式,加快了邻接信息查询.实验结果表明,本方法提升渐进网格的空间效率,缩短渐进网格的生成时间.Progressive meshes will meet the requirements of generating multi-resolutions meshes of a 3D model. Among the methods available, more than 4 adjacent vertices are associated to simplify a vertex. Moreover, meshes are represented by vertex-face list structure, which has bad experience in searching neighbor information. In this paper, subdivision method is introduced to predict the vertex to be simplified, and only √3 adjacent vertices are considered. In the meantime, a half-edge map is constructed to replace vertex-face list so as to speed up the neighbor information search. Experimental results show that the method proposed in this paper improves both time efficiency and space efficiency of generating progressive meshes.

关 键 词：半边结构 √3细分 渐进网格 网格压缩 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]