A Parallel Approach to Compression and Decompression of Triangle Meshes using the GPU
| Autor: | Johannes Jakob, Michael Guthe, Christoph Buchenau |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Computer science
020207 software engineering Volume rendering Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Computer Graphics and Computer-Aided Design Graphics pipeline Computational science Real-time computer graphics Computer graphics Tree traversal Vector graphics Parallel processing (DSP implementation) 020204 information systems S3 Texture Compression 0202 electrical engineering electronic engineering information engineering Polygon mesh Geometric primitive Graphics address remapping table General-purpose computing on graphics processing units 2D computer graphics Massively parallel 3D computer graphics Data compression |
| Zdroj: | Computer Graphics Forum. 36:71-80 |
| ISSN: | 0167-7055 |
| Popis: | Most state-of-the-art compression algorithms use complex connectivity traversal and prediction schemes, which are not efficient enough for online compression of large meshes. In this paper we propose a scalable massively parallel approach for compression and decompression of large triangle meshes using the GPU. Our method traverses the input mesh in a parallel breadth-first manner and encodes the connectivity data similarly to the well known cut-border machine. Geometry data is compressed using a local prediction strategy. In contrast to the original cut-border machine, we can additionally handle triangle meshes with inconsistently oriented faces. Our approach is more than one order of magnitude faster than currently used methods and achieves competitive compression rates. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |