Hierarchical Laplacian-based compression of triangle meshes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43923801" target="_blank" >RIV/49777513:23520/14:43923801 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.gmod.2014.09.003" target="_blank" >http://dx.doi.org/10.1016/j.gmod.2014.09.003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.gmod.2014.09.003" target="_blank" >10.1016/j.gmod.2014.09.003</a>

Result language
angličtina
Original language name
Hierarchical Laplacian-based compression of triangle meshes
Original language description
In this paper, we present an algorithm for efficient encoding of triangle meshes. The algorithm preserves the local relations between vertices by encoding their Laplacian coordinates, while at the same time, it uses a hierarchy of additional vertex constraints that provides global rigidity and low absolute error, even for large meshes. Our scheme outperforms traversal based as well as Laplacian-based compression schemes in terms of both absolute and perceived distortion at a given data rate.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/ED1.1.00%2F02.0090" target="_blank" >ED1.1.00/02.0090: NTIS - New Technologies for Information Society</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)