首页> 外文会议>SIGGRAPH conference on computer graphics >Constrained Texture Mapping for Polygonal Meshes
【24h】

Constrained Texture Mapping for Polygonal Meshes

机译:多边形网格的约束纹理映射

获取原文

摘要

Recently, time and effort have been devoted to automatic texture mapping. It is possible to study the parameterization function and to describe the texture mapping process in terms of a functional optimization problem. Several methods of this type have been proposed to minimize deformations. However, these existing methods suffer from several limitations. For instance, it is difficult to put details of the texture in correspondence with features of the model, since most of the existing methods can only constrain iso-parametric curves. We introduce in this paper a new optimization-based method for parameterizing polygonal meshes with minimum deformations, while enabling the user to interactively define and edit a set of constraints. Each user-defined constraint consists of a relation linking a 3D point picked on the surface and a 2D point of the texture. Moreover, the non-deformation criterion introduced here can act as an extrapolator, thus making it unnecessary to constrain the border of the surface, in contrast with classic methods. To minimize the crite-rion, a conjugate gradient algorithm is combined with a compressed representation of sparse matrices, making it possible to achieve a fast convergence.
机译:最近,已经致力于自动纹理映射的时间和精力。可以研究参数化功能并在功能优化问题方面描述纹理映射过程。已经提出了几种这种类型的方法来最小化变形。然而,这些现有方法遭受了几个限制。例如,难以将纹理的细节与模型的特征相对应,因为大多数现有方法只能限制ISO-参数曲线。我们本文介绍了一种新的基于优化的方法,用于参数化具有最小变形的多边形网格,同时使用户能够以交互方式定义和编辑一组约束。每个用户定义的约束包括链接在表面上拾取的3D点的关系和纹理的2D点。此外,这里引入的非变形标准可以用作外推,因此与经典方法相比,不必限制表面的边界。为了最小化Crite-Rion,将共轭梯度算法与稀疏矩阵的压缩表示组合,使得可以实现快速收敛。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号