Premium
Compressing dynamic meshes with geometric laplacians
Author(s) -
Váša L.,
Marras S.,
Hormann K.,
Brunnett G.
Publication year - 2014
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12304
Subject(s) - polygon mesh , computer science , skinning , laplace operator , sequence (biology) , encode , focus (optics) , distortion (music) , algorithm , enhanced data rates for gsm evolution , surface (topology) , triangle mesh , theoretical computer science , computer graphics (images) , mathematics , artificial intelligence , geometry , mathematical analysis , ecology , biochemistry , chemistry , genetics , physics , amplifier , bandwidth (computing) , computer network , gene , biology , optics
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.