Jakob, JohannesBuchenau, ChristophGuthe, MichaelBærentzen, Jakob Andreas and Hildebrandt, Klaus2017-07-022017-07-0220171467-8659https://doi.org/10.1111/cgf.13246https://diglib.eg.org:443/handle/10.1111/cgf13246Most 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.I.3.6 [Computer Graphics]Methodology and TechniquesGraphics data structures and data typesI.3.5 [Computer Graphics]Computational Geometry and Object ModelingGeometric algorithmslanguagesand systemsI.3.1 [Computer Graphics]Hardware ArchitectureParallel processing10.1111/cgf.13246071-080