Priority‐based encoding of triangle mesh connectivity for a known geometry
| dc.contributor.author | Dvořák, Jan | en_US |
| dc.contributor.author | Káčereková, Zuzana | en_US |
| dc.contributor.author | Vaněček, Petr | en_US |
| dc.contributor.author | Váša, Libor | en_US |
| dc.contributor.editor | Hauser, Helwig and Alliez, Pierre | en_US |
| dc.date.accessioned | 2023-03-22T15:07:12Z | |
| dc.date.available | 2023-03-22T15:07:12Z | |
| dc.date.issued | 2023 | |
| dc.description.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. | en_US |
| dc.description.number | 1 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 42 | |
| dc.identifier.doi | 10.1111/cgf.14719 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 60-71 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14719 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14719 | |
| dc.publisher | Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd. | en_US |
| dc.subject | data compression | |
| dc.subject | modelling | |
| dc.subject | geometric modelling | |
| dc.subject | modelling | |
| dc.subject | polygonal modelling | |
| dc.subject | modelling | |
| dc.title | Priority‐based encoding of triangle mesh connectivity for a known geometry | en_US |