递进网格的一种快速生成算法

成迟薏; 潘志庚; 石教英

doi:10.11834/jig.1998011277

计算机图形学 | 浏览量 : 0 下载量: 168 CSCD: 0

PDF
导出
分享
收藏
专辑

递进网格的一种快速生成算法
A High speed Generation Algorithm for Progressive Meshes
1998年3卷第11期页码：946
纸质出版：1998
DOI： 10.11834/jig.1998011277
稿件说明：

移动端阅览

成迟薏, 潘志庚, 石教英. 递进网格的一种快速生成算法[J]. 中国图象图形学报, 1998,3(11):946. DOI： 10.11834/jig.1998011277.

A High speed Generation Algorithm for Progressive Meshes[J]. Journal of Image and Graphics, 1998, 3(11): 946. DOI： 10.11834/jig.1998011277.

摘要

递进网格表示法能高效地存储网格信息，并能生成连续的细节层次模型，支持模型的多分辨率表示、递进传输、网格压缩和有选择精化。此文给出了一种递进网格的生成算法，该算法能有效地控制简化网格与原始网格的误差，速度较快并能很好地保持原模型的边界特征

Abstract

Progressive meshes can store mesh information efficiently and generate continuous level of detail (LOD) models. They support multiresolution representation

progressive transmission and selective refinement. A high speed algorithm for generating progressive meshes based on edge collapses in presented in this paper. This algorithm provides an efficient error management for the process of mesh simplification. The speed of the algorithm is very fast and the boundary features are well preserved.