The POP Buffer: Rapid Progressive Clustering by Geometry Quantization

被引:30
作者
Limper, M. [1 ,2 ]
Jung, Y. [2 ]
Behr, J. [2 ]
Alexa, M. [3 ]
机构
[1] Tech Univ Darmstadt, Darmstadt, Germany
[2] Fraunhofer IGD, Darmstadt, Germany
[3] TU Berlin, Berlin, Germany
关键词
COMPRESSION;
D O I
10.1111/cgf.12227
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Within this paper, we present a novel, straightforward progressive encoding scheme for general triangle soups, which is particularly well-suited for mobile and Web-based environments due to its minimal requirements on the client's hardware and software. Our rapid encoding method uses a hierarchy of quantization to effectively reorder the original primitive data into several nested levels of detail. The resulting stateless buffer can progressively be transferred as-is to the GPU, where clustering is efficiently performed in parallel during rendering. We combine our approach with a crack-free mesh partitioning scheme to obtain a straightforward method for fast streaming and basic view-dependent LOD control.
引用
收藏
页码:197 / 206
页数:10
相关论文
共 39 条
[1]   R-D optimized progressive compression of 3D meshes using prioritized gate selection and curvature prediction [J].
Ahn, Jae-Kyun ;
Lee, Dae-Youn ;
Ahn, Minsu ;
Kim, Chang-Su .
VISUAL COMPUTER, 2011, 27 (6-8) :769-779
[2]  
Alliez P, 2001, COMP GRAPH, P195, DOI 10.1145/383259.383281
[3]  
[Anonymous], P VMV
[4]  
Behr J., 2009, WEB3D 09 P 14 INT C, P127, DOI DOI 10.1145/1559764.1559784
[5]  
Behr J, 2012, WEB3D 2012, P17
[6]   On the optimality of spectral compression of mesh data [J].
Ben-Chen, M ;
Gotsman, C .
ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (01) :60-80
[7]   Optimized geometry compression for real-time rendering [J].
Chow, MM .
VISUALIZATION '97 - PROCEEDINGS, 1997, :347-+
[8]  
Chun W, 2012, OPENGL INSIGHTS, P431
[9]  
DeCoro C, 2007, I3D 2007: ACM SIGGRAPH SYMPOSIUM ON INTERACTIVE 3D GRAPHICS AND GAMES, PROCEEDINGS, P161
[10]  
Deering M., 1995, Computer Graphics Proceedings. SIGGRAPH 95, P13, DOI 10.1145/218380.218391