Priority-based encoding of triangle mesh connectivity for a known geometry |
| |
Authors: | Jan Dvo?ák Zuzana Ká?ereková Petr Vaně?ek Libor Vá?a |
| |
Affiliation: | Department of Computer Science and Engineering, Faculty of Applied Sciences, University of West Bohemia, Czech Republic |
| |
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. |
| |
Keywords: | data compression modelling geometric modelling modelling polygonal modelling modelling |
|
|