首页> 中文期刊> 《计算机系统应用》 >基于半边结构和√3细分的渐进网格生成方法

基于半边结构和√3细分的渐进网格生成方法

     

摘要

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.%渐进网格可以满足生成多分辨率模型的需求.在现有渐进网格生成方法中,一个顶点的简化往往关联四个以上的相邻顶点.并且,现有方法多采用网格的点面列表结构表示.本文采用√3细分预测方法生成渐进网格,每个顶点的存储仅关联三个相邻顶点.同时也使用半边数据结构替代网格的点面列表表示形式,加快了邻接信息查询.实验结果表明,本方法提升渐进网格的空间效率,缩短渐进网格的生成时间.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号