Compressing Dynamic Meshes with Geometric Laplacians

Simple item page
dc.contributor.authorVasa, Liboren_US
dc.contributor.authorMarras, Stefanoen_US
dc.contributor.authorHormann, Kaien_US
dc.contributor.authorBrunnett, Guidoen_US
dc.contributor.editorB. Levy and J. Kautzen_US
dc.date.accessioned2015-03-03T12:27:23Z
dc.date.available2015-03-03T12:27:23Z
dc.date.issued2014en_US
dc.description.abstractThis 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.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/cgf.12304en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12304en_US
dc.publisherThe Eurographics Association and John Wiley and Sons Ltd.en_US
dc.titleCompressing Dynamic Meshes with Geometric Laplaciansen_US
Files
Collections
33-Issue 2
Full Papers 2014 - CGF 33-Issue 2