Cecchin, AliceDu, PaulPastor, MickaëlAgouzoul, AsmaSauvage, BasileHasic-Telalovic, Jasminka2022-04-222022-04-222022978-3-03868-171-71017-4656https://doi.org/10.2312/egp.20221015https://diglib.eg.org:443/handle/10.2312/egp20221015We introduce a framework extending an existing progressive compression-decompression algorithm for 3D triangular meshes. First, a mesh is partitioned. Each resulting part is compressed, then joined with one of its neighbours. These steps are repeated following a binary tree of operations, until a single compressed mesh remains. Decompressing the mesh involves progressively performing those steps in reverse, per node, and locally, by selecting the branch of the tree to explore. This method creates a compact and lossless representation of the model that allows its progressive and local reconstruction. Previously unprocessable meshes can be visualized on the web and mobile devices using this technique.Attribution 4.0 International LicenseCCS Concepts: Information systems --> Data compression; Computing methodologies --> Mesh geometry modelsInformation systemsData compressionComputing methodologiesMesh geometry models10.2312/egp.2022101533-342 pages