Data-Parallel Decompression of Triangle Mesh Topology
| Autor: | Benjamin Keinert, Gerd Sußner, Quirin Meyer, Marc Stamminger |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Lossless compression
Computer science Topology (electrical circuits) Data_CODINGANDINFORMATIONTHEORY Parallel computing Topology Computer Graphics and Computer-Aided Design Vertex (geometry) CUDA Computer Science::Graphics Triangle mesh Benchmark (computing) Code (cryptography) Shader ComputingMethodologies_COMPUTERGRAPHICS |
| Zdroj: | Computer Graphics Forum. 31:2541-2553 |
| ISSN: | 0167-7055 |
| DOI: | 10.1111/j.1467-8659.2012.03221.x |
| Popis: | 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. © 2012 Wiley Periodicals, Inc. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|