Priority‐based encoding of triangle mesh connectivity for a known geometry

Loading...
Thumbnail Image
Date
2023
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.
Abstract
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.
Description

        
@article{
10.1111:cgf.14719
, journal = {Computer Graphics Forum}, title = {{
Priority‐based encoding of triangle mesh connectivity for a known geometry
}}, author = {
Dvořák, Jan
and
Káčereková, Zuzana
and
Vaněček, Petr
and
Váša, Libor
}, year = {
2023
}, publisher = {
Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.
}, ISSN = {
1467-8659
}, DOI = {
10.1111/cgf.14719
} }
Citation
Collections