Show simple item record

dc.contributor.authorDvořák, Janen_US
dc.contributor.authorKáčereková, Zuzanaen_US
dc.contributor.authorVaněček, Petren_US
dc.contributor.authorVáša, Liboren_US
dc.contributor.editorHauser, Helwig and Alliez, Pierreen_US
dc.date.accessioned2023-03-22T15:07:12Z
dc.date.available2023-03-22T15:07:12Z
dc.date.issued2023
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.14719
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf14719
dc.description.abstractIn 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.publisherEurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.en_US
dc.subjectdata compression
dc.subjectmodelling
dc.subjectgeometric modelling
dc.subjectmodelling
dc.subjectpolygonal modelling
dc.subjectmodelling
dc.titlePriority‐based encoding of triangle mesh connectivity for a known geometryen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersArticles
dc.description.volume42
dc.description.number1
dc.identifier.doi10.1111/cgf.14719
dc.identifier.pages60-71


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record