Data‐Parallel Decompression of Triangle Mesh Topology
| dc.contributor.author | Meyer, Quirin | en_US |
| dc.contributor.author | Keinert, Benjamin | en_US |
| dc.contributor.author | Sußner, Gerd | en_US |
| dc.contributor.author | Stamminger, Marc | en_US |
| dc.contributor.editor | Holly Rushmeier and Oliver Deussen | en_US |
| dc.date.accessioned | 2015-02-28T08:23:26Z | |
| dc.date.available | 2015-02-28T08:23:26Z | |
| dc.date.issued | 2012 | en_US |
| dc.description.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.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. | en_US |
| dc.description.number | 8 | |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 31 | |
| dc.identifier.doi | 10.1111/j.1467-8659.2012.03221.x | |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2012.03221.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Data‐Parallel Decompression of Triangle Mesh Topology | en_US |