Compressing Dynamic Meshes with Geometric Laplacians
Loading...
Date
2014
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and John Wiley and Sons Ltd.
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.
Description
@article{:10.1111/cgf.12304,
journal = {Computer Graphics Forum},
title = {{Compressing Dynamic Meshes with Geometric Laplacians}},
author = {Vasa, Libor and Marras, Stefano and Hormann, Kai and Brunnett, Guido},
year = {2014},
publisher = {The Eurographics Association and John Wiley and Sons Ltd.},
ISSN = {1467-8659},
DOI = {/10.1111/cgf.12304}
}