Compressing dynamic meshes with geometric laplacians

Abstract

This paper addresses the problem of representing dynamic 3D meshes in a compact way, so that they can be stored and transmitted efficiently. We focus on sequences of triangle meshes with shared connectivity, avoiding the necessity of having a skinning structure. Our method first computes an average mesh of the whole sequence in edge shape space. A discrete geometric Laplacian of this average surface is then used to encode the coefficients that describe the trajectories of the mesh vertices. Optionally, a novel spatio-temporal predictor may be applied to the trajectories to further improve the compression rate. We demonstrate that our approach outperforms the current state of the art in terms of low data rate at a given perceived distortion, as measured by the STED and KG error metrics.

Articulated‐Motion‐Aware Sparse Localized Decomposition

“…All aforementioned methods do not construct a genuine shape subspace in the sense that the geometric agents such as base meshes, cages and skeletons do not form a set of bases of the shape space. As a data analysis tool, PCA can extract a set of orthogonal bases and therefore has been frequently employed to compress animated meshes [AM00, ASS06, VMHB14]. However, the principal components obtained in this case do not have intuitive relations with semantic movements.…”

Error diffusion on meshes

“…The application on quantizing the coefficients of trajectory data results in promising improvements. It appears these improvements transfer to the recent state-of-the-art versions of this compression scheme [35]. The modification of TOPSTOC improves the quality of the simplified geometry, at negligible extra cost.…”

Spectral Processing of Tangential Vector Fields

“…This approach extends existing approaches from mesh compression [KG00] or dynamic mesh compression [VMHB14] to the compression of tangential vector fields on meshes. Compression can be achieved by cutting off the higher coefficients, since the high-frequency part of the fields is typically small.…”

“…By transforming a function into this basis, it is decomposed into oscillations that are ordered by their frequencies. Recently, a scheme for the compression of dynamic mesh sequences was introduced by Váša et al [VMHB14] . the embedding of the surface in R 3 ) can be treated in this way.…”