一种基于面积比不变性约束的曲面纹理算法

文中运用两步映射原理解决了曲面的参数化问题，改进了一种采用面积比不变性约束的球冠映射算法，消除了采用传统的整球面和半球面参数化方法向中间曲面作映射所带来的纹理变形问题，进而较好地实现了由非参数化面片拼接成的曲面表面的纹理映射。     

一种基于面积比不变性约束的曲面纹理算法

文中运用两步映射原理解决了曲面的参数化问题,改进了一种采用面积比不变性约束的球冠映射算法,消除了采用传统的整球面和半球面参数化方法向中间曲面作映射所带来的纹理变形问题,进而较好地实现了由非参数化面片拼接成的曲面表面的纹理映射。     

基于弹簧-质点模型的不规则曲面纹理映射

针对三角网格表示的不规则曲面的纹理映射问题,提出一种基于弹簧-质点模型的简单、高效、失真小的纹理映射算法。结合调和映射的参数化方法以及弹簧-质点模型的复杂平面展开方法,保持拓扑关系地将三维曲面投影于平面内;通过建立三角网格表示的投影面的弹簧-质点模型,将不规则曲面参数化于给定大小的矩形域;利用参数化的结果计算不规则曲面各顶点的纹理坐标,进行纹理贴图。实验结果表明,该算法能够实现纹理高效、均匀、变形小地映射于任意不规则曲面上。     

层次参数化的自由曲面特征表示与实现

为了解决自由曲面特征参数化问题,提出一种自由曲面特征参数分层实现框架.采用从高层到底层、从整体到局部的分层思想,将自由曲面特征的参数及映射关系划分为"3层参数和2级映射"结构来定义曲面特征,即高层语义参数表示整体形状,中间层参数表示特征线和底层参数表示细节形状,并在各层参数间建立映射和约束关系;同时支持设计者用Scheme命令快速实例化曲面特征.该方法避免了传统方式中由高层特征参数到底层数据间直接的复杂映射关系,且方便了曲面特征的实例化.实验结果表明,文中方法使得设计者能够从特征语义层直观地编辑修改自由曲面特征,是一种有效的自由曲面特征参数化表示和实现方法.     

网格曲面参数化映射的变形补偿及其在曲面加工中的应用

针对基于网格曲面参数化的轨迹规划中存在映射变形进而影响轨迹规划精度的问题,在分析网格曲面参数化映射变形场的基础上,提出了引入映射变形补偿的计算方法,包括补偿角度变形的方向映射、补偿拉伸变形的长度映射、针对不同三角片具有不同映射变形量的大跨度映射变形处理策略.在实例分析中,对参数化结果的映射变形进行了量化评估,并生成了复杂网格曲面上的等距线环形轨迹与实际的摆线抛光轨迹,验证了所提方法能够有效地补偿映射变形,保证轨迹规划的精确性,从而能够充分发挥网格曲面参数化的降维优势.     

体参数化模型离散调和映射生成

目的 体参数化模型具有诸多优良特性和广泛的应用前景,如何生成有效的体参数化模型是迫切需要解决的问题.方法 首先定义了样条体参数化模型表达式,提出控制点设定是体参数化的核心问题.给定6个表面样条曲面的控制点,从计算域到参数域的调和映射方程的差分形式出发,给出了生成体参数化模型控制点的方法.提出雅克比矩阵和等参网两种方法用以检测体参数化模型的网格质量.结果 基于点云模型,构建了体参数化模型,且将该方法与离散孔斯插值法、凸组合插值法两种方法生成的体参数化模型网格质量进行了对比.结果表明,离散调和函数法生成的体参数化模型相对更为稳定与优化.结论 离散调和映射能初步生成体参数化模型,但需要进一步优化并提供了良好初始化条件.     

三角网格的能量优化参数化方法

三角网格参数化是纹理映射、曲面拟合与曲面重构、网格编辑等工作的基础和环节,参数化变形的大小是衡量参数化好坏的标准.为此提出一种基于变形能量优化的三角网格参数化方法.采用区域增长算法逐层展平空间三角网格,得到空间三角网格曲面的自由边界的参数化结果,并利用保形变换将自由边界的参数化结果变换为规则边界的参数化结果;同时兼顾了参数化的角度变形和面积变形,使得参数化结果具有整体变形较小的特点,并能够避免三角形折叠的现象.将该方法应用于纹理映射中的数值实验表明,其比常见的几种参数化方法具有更好的纹理映射效果.     

基于Kohonen神经网络的B样条曲面重构

探讨了三维散乱数据点的自由曲面自组织重构方法。建立了基于自组织特征映射神经网络的矩形网格重构模型及其训练算法。所建模型利用神经元对曲面散乱数据点的学习和训练来模拟曲面上点与点之间的内在关系,节点连接权向量集作为对散乱数据点集的工程近似化并重构曲面样本点的内在拓扑关系。通过该方法不仅能够对无规则散乱数据点进行逼近,并且通过该方法得到的曲面也可以作为后继曲面重构的初始曲面。仿真实验表明,所建神经网络模型可实现三维密集无规则数据点的曲面自组织重构集自压缩于一体。     

限制失真的网格参数化方法

针对当前网格参数化效率较低、映射失真较严重的问题，提出一种限制失真的网格参数化方法。首先，预处理原始网格模型。输入原3D网格模型，采用Half-Edge数据结构来重新组织网格并切割网格模型产生相应的切缝；构建Tutte映射把3D网格映射到一个2D凸多边形域，即构建2D网格模型。然后，进行限制失真的网格参数化计算。将Tutte映射后的2D网格模型作为限制失真计算的初始数据，建立相对于原3D模型网格的失真度量函数；求得该度量函数的最小值点，即为映射后的网格坐标集合；将映射后的网格作为限制失真映射的输入网格，设定迭代终止条件，循环迭代直至迭代结束，得到收敛的最优网格坐标；在计算映射失真度时，针对等距映射失真采用Dirichlet能量函数度量，针对共形映射失真采用尽可能等距（MIPS）能量函数度量；在求解映射失真度量函数的最小值点时采用代理函数法结合组合牛顿法的最优解方法。最终，实现了该方法并开发了一个原型系统。在原型系统中，分别设计了限制等距失真和限制共形失真的网格参数化实验，对程序执行时间和失真能量下降情况进行了统计和对比，提供了相应的纹理映射效果展示。实验数据表明，所提出的方法执行效率高、映射失真能量下降快，最优值收敛质量稳定；纹理映射时纹理着色均匀、布局紧致、线条均匀，符合实际应用的标准。     

基于两步法的交互式纹理映射研究

两步纹理映射方法将映射过程分解为S映射与O映射两步进行.针对两步纹理映射方法研究中复杂物体表面纹理映射时出现的变形问题,采用B样条曲面代替简单的中间映射媒介,用它近似地包裹在三维物体的外表面,将纹理通过某种方式映射到曲面上实现参数化.基于两步映射方法提出了一种交互式纹理映射的算法.该算法允许用户交互选择贴图范围,通过控制B样条曲面实现对映射效果的调整.实验结果表明,该算法可显著提高纹理映射质量,纹理贴图效果良好.     

点集表面的共形参数化

基于点的图形系统成为图形学研究中的一个热点。该文介绍了一种无组织点集表面的共形参数化方法,在该参数化方法中,传统算法中经常使用的欧氏距离被测地线距离所代替。相对于欧氏距离,测地线距离能够更好地描述点集所隐含的表面,减少由点集表面无拓扑性质带来的误差,保持点集曲面的形状不变,提高参数化的质量。     

An analytical representation of conformal mapping for genus-zero implicit surfaces and its application to surface shape similarity assessment

This paper develops an analytical representation of conformal mapping for genus-zero implicit surfaces based on algebraic polynomial functions, and its application to surface shape similarity assessment. Generally, the conformal mapping often works as a tool of planar or spherical parameterization for triangle mesh surfaces. It is further exploited for implicit surface matching in this study. The method begins with discretizing one implicit surface by triangle mesh, where a discrete harmonic energy model related to both the mesh and the other implicit surface is established based on a polynomial-function mapping. Then both the zero-center constraint and the landmark constraints are added to the model to ensure the uniqueness of mapping result with the Möbius transformation. By searching optimal polynomial coefficients with the Lagrange–Newton method, the analytical representation of conformal mapping is obtained, which reveals all global and continuous one-to-one correspondent point pairs between two implicit surfaces. Finally, a shape similarity assessment index for (two) implicit surfaces is proposed through calculating the differences of all the shape index values among those corresponding points. The proposed analytical representation method of conformal mapping and the shape assessment index are both verified by the simulation cases for the closed genus-zero implicit surfaces. Experimental results show that the method is effective for genus-zero implicit surfaces, which will offer a new way for object retrieval and manufactured surface inspection.     

三维地质界面网格模型构建算法研究

三维地质模型主要包含地质构造模型和地质属性模型。提出一种局部映射-边界控制的曲面三角化网格模型构建算法,与映射法相比,减少三维空间点映射到二维平面的计算过程,避免因多点到一点的映射关系而生成错误的三角化网格模型。基于地质测量数据特点,原始地质数据经处理后采用点集合形式表示,基于点集数据构建三维三角化网格模型,模拟地质界面的展布形态,控制三角网格质量。采用两种网格边界控制方法,在有边界约束数据和无边界约束数据条件下均能自动更新地质界面三角化网格模型边界。基于断层点数据集测试并展示算法构建的三维三角化网格模型可视化效果,通过断层面三角化网格模型能够反映断层面之间空间位置关系。     

Projection Mapping on Arbitrary Cubic Cell Complexes

This work presents a new representation used as a rendering primitive of surfaces. Our representation is defined by an arbitrary cubic cell complex: a projection‐based parameterization domain for surfaces where geometry and appearance information are stored as tile textures. This representation is used by our ray casting rendering algorithm called projection mapping, which can be used for rendering geometry and appearance details of surfaces from arbitrary viewpoints. The projection mapping algorithm uses a fragment shader based on linear and binary searches of the relief mapping algorithm. Instead of traditionally rendering the surface, only front faces of our rendering primitive (our arbitrary cubic cell complex) are drawn, and geometry and appearance details of the surface are rendered back by using projection mapping. Alternatively, another method is proposed for mapping appearance information on complex surfaces using our arbitrary cubic cell complexes. In this case, instead of reconstructing the geometry as in projection mapping, the original mesh of a surface is directly passed to the rendering algorithm. This algorithm is applied in the texture mapping of cultural heritage sculptures.     

一种应用平面展开完成任意曲面纹理映射的新方法

本文提出一种新的纹理映射方法。该方法在任意曲面和它的平面展开之间定义映射,并用映射特征来评价映射精度,能有效地减少任意曲面纹理映射中的映射变形误差。     

基于曲线的纹理映射

本文提出一种纹理映射的新方法。二维平面中的一条曲线与三维曲面上的一条曲线相对应，两条曲线上的点再相对应。当对应曲线足够多时，就可获理完成纹理映射所需的足够信息。     

具有保面积参数化的双二次Bézier曲面

为了构建具有保面积参数化的双二次Bézier曲面,提出2种双二次Bézier曲面的构造算法.首先根据曲面第一微分基本形式,推导双线性和双二次Bézier曲面满足保面积参数化的约束条件,得出具有保面积参数化的双线性有理Bézier曲面只能是平行四边形的结论;然后根据双二次曲面的约束条件,通过求解方程组的形式设计符合约束条...     

Ptex: Per‐Face Texture Mapping for Production Rendering

Explicit parameterization of subdivision surfaces for texture mapping adds significant cost and complexity to film production. Most parameterization methods currently in use require setup effort, and none are completely general. We propose a new texture mapping method for Catmull‐Clark subdivision surfaces that requires no explicit parameterization. Our method, Ptex, stores a separate texture per quad face of the subdivision control mesh, along with a novel per‐face adjacency map, in a single texture file per surface. Ptex uses the adjacency data to perform seamless anisotropic filtering of multi‐resolution textures across surfaces of arbitrary topology. Just as importantly, Ptex requires no manual setup and scales to models of arbitrary mesh complexity and texture detail. Ptex has been successfully used to texture all of the models in an animated theatrical short and is currently being applied to an entire animated feature. Ptex has eliminated UV assignment from our studio and significantly increased the efficiency of our pipeline.     

Content-aware texture mapping

Interactively mapping texture into a curved surface has wide applications. Apart from mapping texture to desired positions with low distortions, which has been considered by existing works, few work considered the intuitive need to distribute distortions according to the texture contents. In this work, we present a texture mapping method guided by importance map to preserve the shape of the prominent content. We formulate it as an importance-value-weighted parameterization. The mapping distortions are measured by LSCM+ energy, which is capable of decreasing the appearance of shrunken and fold-over triangles as well as shape preservation; and the weights are efficiently calculated by transforming the area integral into a line integral. To solve the parameterization, we employ the ‘L–M’ (Levenberg–Marquardt) method and alternately update the weights and the coordinates since they are dependent on each other. Finally, we show some examples to demonstrate the content-aware effect by comparison to traditional parameterization.