Back to Search
Start Over
Data-Parallel Decompression of Triangle Mesh Topology.
- Source :
- Computer Graphics Forum; Dec2012, Vol. 31 Issue 8, p2541-2553, 13p, 1 Color Photograph, 2 Diagrams, 6 Charts
- Publication Year :
- 2012
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01677055
- Volume :
- 31
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- Computer Graphics Forum
- Publication Type :
- Academic Journal
- Accession number :
- 82763843
- Full Text :
- https://doi.org/10.1111/j.1467-8659.2012.03221.x