Premium
Data‐Parallel Decompression of Triangle Mesh Topology
Author(s) -
Meyer Quirin,
Keinert Benjamin,
Sußner Gerd,
Stamminger Marc
Publication year - 2012
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2012.03221.x
Subject(s) - computer science , lossless compression , triangle mesh , scalability , parallel computing , cuda , algorithm , data compression , codec , compression (physics) , computer graphics (images) , polygon mesh , computer hardware , materials science , database , composite material
We propose a lossless, single‐rate triangle mesh topology codec tailored for fast data‐parallel GPU decompression. Our compression scheme coherently orders generalized triangle strips in memory. To unpack generalized triangle strips efficiently, we propose a novel parallel and scalable algorithm. We order vertices coherently to further improve our compression scheme. We use a variable bit‐length code for additional compression benefits, for which we propose a scalable data‐parallel decompression algorithm. For a set of standard benchmark models, we obtain (min: 3.7, med: 4.6, max: 7.6) bits per triangle. Our CUDA decompression requires only about 15% of the time it takes to render the model even with a simple shader.