###
计算机系统应用英文版:2017,26(11):238-242
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
基于半边结构和√3细分的渐进网格生成方法
(1.浙江工业大学 计算机科学与技术学院, 杭州 310023;2.浙江商业职业技术学院 应用工程学院, 杭州 310053;3.广东第二师范学院 计算机科学系, 广州 510303)
Progressive Mesh Generating Method Based on Half-Edge Structure and √3 Subdivision
(1.Computer Science and Technology School, Zhejiang University of Technology, Hangzhou 310023, China;2.Application Engineering School, Zhejiang Vocational College of Commerce, Hangzhou 310053, China;3.Computer Science Department, Guangdong University of Education, Guangzhou 510303, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1594次   下载 1863
Received:February 24, 2016    Revised:March 22, 2016
中文摘要: 渐进网格可以满足生成多分辨率模型的需求.在现有渐进网格生成方法中,一个顶点的简化往往关联四个以上的相邻顶点.并且,现有方法多采用网格的点面列表结构表示.本文采用√3细分预测方法生成渐进网格,每个顶点的存储仅关联三个相邻顶点.同时也使用半边数据结构替代网格的点面列表表示形式,加快了邻接信息查询.实验结果表明,本方法提升渐进网格的空间效率,缩短渐进网格的生成时间.
Abstract: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, √3 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.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然基金(61640222, 61772140);广东科技计划项目(2017A010101021);广州市科技计划项目(201604010049)
引用文本:
马建平,柴毅,陈渤,徐家园,陈强.基于半边结构和√3细分的渐进网格生成方法.计算机系统应用,2017,26(11):238-242
MA Jian-Ping,CHAI Yi,CHEN Bo,XU Jia-Yuan,CHEN Qiang.Progressive Mesh Generating Method Based on Half-Edge Structure and √3 Subdivision.COMPUTER SYSTEMS APPLICATIONS,2017,26(11):238-242