View Dependent Decompression for Web-based Massive Triangle Meshes Visualisation

Abstract

We 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.