Compressed progressive meshes

被引:202
作者
Pajarola, R [1 ]
Rossignac, J
机构
[1] Univ Calif Irvine, Dept Informat & Comp Sci, Irvine, CA 92697 USA
[2] Georgia Inst Technol, Graph Visualizat & Usabil Ctr, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
triangle mesh compression; geometry compression; progressive meshes; multiresolution modeling;
D O I
10.1109/2945.841122
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Most systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of these representations imposes limits on applications for which complex 3D models must be accessed remotely. Techniques for simplifying and compressing 3D models reduce the transmission time. Multiresolution formats provide quick access to a crude model and then refine it progressively. Unfortunately, compared to the best nonprogressive compression methods, previously proposed progressive refinement techniques impose a significant overhead when the full resolution model must be downloaded. The CPM (Compressed Progressive Meshes) approach proposed here eliminates this overhead. It uses a new technique, which refines the topology of the mesh in batches, which each increase the number of vertices by up to 50 percent. Less than an amortized total of 4 bits per triangle encode where and how the topological refinements should be applied. We estimate the position of new vertices from the positions of their topological neighbors in the less refined mesh using a new estimator that leads to representations of vertex coordinates that are 50 percent more compact than previously reported progressive geometry compression techniques.
引用
收藏
页码:79 / 93
页数:15
相关论文
共 40 条
[11]  
GUMHOLD S, 1998, P SIGGRAPH 98, P133
[12]  
Heckbert P. S., 1997, SIGGRAPH 97 COURSE N, V25
[13]  
Hoppe H., 1993, Computer Graphics Proceedings, P19, DOI 10.1145/166117.166119
[14]  
Hoppe H., 1996, Computer Graphics Proceedings. SIGGRAPH '96, P99, DOI 10.1145/237170.237216
[15]  
HOPPE H, 1998, MSRTR9802 MICR RES
[16]  
HOPPE H, 1997, P SIGGRAPH 97, P189, DOI DOI 10.1145/258734.258843
[17]  
HOPPE H, SIGGRAPH 98 COURSE N, V21
[18]   A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].
HUFFMAN, DA .
PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101
[19]   Superfaces: Polygonal mesh simplification with bounded error [J].
Kalvin, AD ;
Taylor, RH .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1996, 16 (03) :64-77
[20]  
KING D, 1999, GITGVU9907