All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Error propagation control in Laplacian mesh compression

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43952374" target="_blank" >RIV/49777513:23520/18:43952374 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1111/cgf.13491" target="_blank" >http://dx.doi.org/10.1111/cgf.13491</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1111/cgf.13491" target="_blank" >10.1111/cgf.13491</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Error propagation control in Laplacian mesh compression

  • Original language description

    Laplacian mesh compression, also known as high-pass mesh coding, is a popular technique for efficiently storing both static and dynamic triangle meshes that gained further recognition with the advent of perceptual mesh distortion evaluation metrics. Currently, the usual rule of thumb that drives the decision for a mesh compression algorithm is whether or not accuracy in absolute scale is required: Laplacian mesh encoding is chosen when perceptual quality is the main objective, while other techniques provide better results in terms of mechanistic error measures such as mean squared error. In this work, we present a modification of the Laplacian mesh encoding algorithm that preserves its benefits while it substantially reduces the resulting absolute error. Our approach is based on analyzing the reconstruction stage and modifying the quantization of differential coordinates, so that the decoded result stays close to the input even in areas that are distant from anchor points. In our approach, we avoid solving an overdetermined system of linear equations and thus reduce data redundancy, improve conditioning and achieve faster processing. Our approach can be directly applied to both static and dynamic mesh compression and we provide quantitative results comparing our approach with the state of the art methods.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/LO1506" target="_blank" >LO1506: Sustainability support of the centre NTIS - New Technologies for the 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

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Computer Graphics Forum

  • ISSN

    1467-8659

  • e-ISSN

  • Volume of the periodical

    37

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    10

  • Pages from-to

    61-70

  • UT code for WoS article

    000440989100006

  • EID of the result in the Scopus database

    2-s2.0-85052224801