Editing mesh sequences with varying connectivity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F24%3A43972181" target="_blank" >RIV/49777513:23520/24:43972181 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0097849324000785" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0097849324000785</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cag.2024.103943" target="_blank" >10.1016/j.cag.2024.103943</a>
Alternative languages
Result language
angličtina
Original language name
Editing mesh sequences with varying connectivity
Original language description
Time-varying connectivity of triangle mesh sequences leads to substantial difficulties in their processing. Unlike editing sequences with constant connectivity, editing sequences with varying connectivity requires addressing the problem of temporal correspondence between the frames of the sequence. We present a method for time-consistent editing of triangle mesh sequences with varying connectivity using sparse temporal correspondence, which can be obtained using existing methods. Our method includes a deformation model based on the usage of the sparse temporal correspondence, which is suitable for the temporal propagation of user-specified deformations of the edited surface with respect to the shape and true topology of the surface while preserving the individual connectivity of each frame. Since there is no other method capable of comparable types of editing on time-varying meshes, we compare our method and the proposed deformation model with a baseline approach and demonstrate the benefits of our framework.
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/GF23-04622L" target="_blank" >GF23-04622L: Data compression paradigm based on omitting self-evident information - COMPROMISE</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
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
COMPUTERS & GRAPHICS-UK
ISSN
0097-8493
e-ISSN
1873-7684
Volume of the periodical
121
Issue of the periodical within the volume
JUN 2024
Country of publishing house
GB - UNITED KINGDOM
Number of pages
13
Pages from-to
—
UT code for WoS article
001244298500001
EID of the result in the Scopus database
2-s2.0-85193785227