Premium
Efficient encoding of texture coordinates guided by mesh geometry
Author(s) -
Váša Libor,
Brunnett Guido
Publication year - 2014
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12428
Subject(s) - parametrization (atmospheric modeling) , computer science , encoding (memory) , vertex (graph theory) , algorithm , parallelogram , polygon mesh , equidistant , topology (electrical circuits) , encode , generalization , laplacian smoothing , mathematics , geometry , theoretical computer science , mesh generation , artificial intelligence , combinatorics , computer graphics (images) , mathematical analysis , finite element method , robot , quantum mechanics , thermodynamics , radiative transfer , chemistry , biochemistry , gene , graph , physics
In this paper, we investigate the possibilities of efficient encoding of UV coordinates associated with vertices of a triangle mesh. Since most parametrization schemes attempt to achieve at least some level of conformality, we exploit the similarity of the shapes of triangles in the mesh and in the parametrization. We propose two approaches building on this idea: first, applying a recently proposed generalization of the parallelogram predictor, using the inner angles of mesh triangles corresponding to the UV‐space triangles. Second, we propose an encoding method based on discrete Laplace operator, which also allows exploiting the information contained in the mesh geometry to efficiently encode the parametrization. Our experiments show that the proposed approach leads to savings of up to 3 bits per UV vertex, without loss of precision.