Out-of-core compression for gigantic polygon meshes

被引:52
作者
Isenburg, M [1 ]
Gumhold, S
机构
[1] Univ N Carolina, Chapel Hill, NC 27514 USA
[2] Univ Tubingen, WSI,GRIS, D-72074 Tubingen, Germany
来源
ACM TRANSACTIONS ON GRAPHICS | 2003年 / 22卷 / 03期
关键词
external memory data structures; mesh compression; out-of-core algorithms; streaming meshes; processing sequences;
D O I
10.1145/882262.882366
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Polygonal models acquired with emerging 3D scanning technology or from large scale CAD applications easily reach sizes of several gigabytes and do not fit in the address space of common 32-bit desktop PCs. In this paper we propose an out-of-core mesh compression technique that converts such gigantic meshes into a streamable, highly compressed representation. During decompression only a small portion of the mesh needs to be kept in memory at any time. As full connectivity information is available along the decompression boundaries, this provides seamless mesh access for incremental in-core processing on gigantic meshes. Decompression speeds are CPU-limited and exceed one million vertices and two million triangles per second on a 1.8 GHz Athlon processor. A novel external memory data structure provides our compression engine with transparent access to arbitrary large meshes. This out-of-core mesh was designed to accommodate the access pattern of our region-growing based compressor, which - in return - performs mesh queries as seldom and as local as possible by remembering previous queries as long as needed and by adapting its traversal slightly. The achieved compression rates are state-of-the-art.
引用
收藏
页码:935 / 942
页数:8
相关论文
共 40 条
[1]  
Alliez P, 2001, COMP GRAPH, P195, DOI 10.1145/383259.383281
[2]  
ALLIEZ P, 2001, EUROGRAPHICS, P480
[3]   Single resolution compression of arbitrary triangular meshes with properties [J].
Bajaj, CL ;
Pascucci, V ;
Zhuang, GZ .
DCC '99 - DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1999, :247-256
[4]   Time/space tradeoffs for polygon mesh rendering [J].
BarYehuda, R ;
Gotsman, C .
ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (02) :141-152
[5]   Building a digital model of Michelangelo's Florentine Pieta [J].
Bernardini, F ;
Rushmeier, H ;
Martin, IM ;
Mittleman, J ;
Taubin, G .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 2002, 22 (01) :59-67
[6]  
CIGNONI P, 2003, IN PRESS IEEE T VIS
[7]  
COHENOR D, 1999, VIS 99 C P, P67
[8]  
Deering M., 1995, Computer Graphics Proceedings. SIGGRAPH 95, P13, DOI 10.1145/218380.218391
[9]  
GU X, 2002, SIGGRAPH 02, P355, DOI DOI 10.1145/566570.566589
[10]   Converting sets of polygons to manifold surfaces by cutting and stitching [J].
Guéziec, A ;
Taubin, G ;
Lazarus, F ;
Horn, W .
VISUALIZATION '98, PROCEEDINGS, 1998, :383-+