Priority-based encoding of triangle mesh connectivity for a known geometry
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F23%3A43967079" target="_blank" >RIV/49777513:23520/23:43967079 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1111/cgf.14719" target="_blank" >https://doi.org/10.1111/cgf.14719</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1111/cgf.14719" target="_blank" >10.1111/cgf.14719</a>
Alternative languages
Result language
angličtina
Original language name
Priority-based encoding of triangle mesh connectivity for a known geometry
Original language description
In certain practical situations, the connectivity of a triangle mesh needs to be transmitted or stored given a fixed set of 3D vertices that is known at both ends of the transaction (encoder/decoder). This task is different from a typical mesh compression scenario, in which the connectivity and geometry (vertex positions) are encoded either simultaneously or in reversed order (connectivity first), usually exploiting the freedom in vertex/triangle re-indexation. Previously proposed algorithms for encoding the connectivity for a known geometry were based on a canonical mesh traversal and predicting which vertex is to be connected to the part of the mesh that is already processed. In this paper, we take this scheme a step further by replacing the fixed traversal with a priority queue of open expansion gates, out of which in each step a gate is selected that has the most certain prediction, that is one in which there is a candidate vertex that exhibits the largest advantage in comparison with other possible candidates, according to a carefully designed quality metric. Numerical experiments demonstrate that this improvement leads to a substantial reduction in the required data rate in comparison with the state of the art.
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/GA20-02154S" target="_blank" >GA20-02154S: Representation and processing methods for three dimensional dynamic shapes</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
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
0167-7055
e-ISSN
1467-8659
Volume of the periodical
42
Issue of the periodical within the volume
1
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
60-71
UT code for WoS article
000878605600001
EID of the result in the Scopus database
2-s2.0-85141375985