Data-Parallel Decompression of Triangle Mesh Topology

Sußner G, Stamminger M, Keinert B, Meyer Q (2012)


Publication Type: Journal article, Original article

Publication year: 2012

Journal

Publisher: Wiley-Blackwell

Book Volume: 31

Pages Range: 2541–2553

Journal Issue: 8

DOI: 10.1111/j.1467-8659.2012.03221.x

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. © 2012 The Eurographics Association and Blackwell Publishing Ltd.

Authors with CRIS profile

How to cite

APA:

Sußner, G., Stamminger, M., Keinert, B., & Meyer, Q. (2012). Data-Parallel Decompression of Triangle Mesh Topology. Computer Graphics Forum, 31(8), 2541–2553. https://doi.org/10.1111/j.1467-8659.2012.03221.x

MLA:

Sußner, Gerd, et al. "Data-Parallel Decompression of Triangle Mesh Topology." Computer Graphics Forum 31.8 (2012): 2541–2553.

BibTeX: Download