基于C-C细分的四边形网格上插值光滑Bézier曲面的生成

在任意拓扑的四边形网格上构造光滑的曲面是计算机辅助几何设计中的一个重要问题.基于C-C细分,提出一种从四边形网格上生成插值网格顶点的光滑Bézier曲面片的算法.将输入四边形网格作为C-C细分的初始控制网格,在四边形网格的每张面上对应得到一张Bézier曲面,使Bézier曲面片逼近C-C细分极限曲面.曲面片在与奇异顶点相连的边界上G1连续,其他地方C2连续.为解决C-C细分的收缩问题,给出了基于误差控制的迭代扩张初始控制网格的方法,使从扩张后网格上生成的曲面插值于初始控制网格的顶点.实验结果表明,该算法效率高,生成的曲面具有较好的连续性,适用于对四边化后的网格模型上重建光滑的曲面.     

表驱动的细分曲面GPU绘制

为了充分利用GPU的并行计算能力高效地绘制递归定义的细分曲面,提出一种基于GPU的面分裂细分曲面的实时绘制算法.该算法通过离线预计算生成可以复用的细分查找表,它由细分矩阵组成,其大小仅与奇异点度数和最大细分深度线性相关,与输入网格无关;对于细分曲面控制网格的每个曲面片,如果包含2个或2个以上奇异点,则进行一次局部预细分;之后对于不规则曲面片,利用细分查找表由初始控制网格直接计算得到各细分层次上的控制顶点,无需逐层计算,从而最大限度地发挥GPU的并行处理能力;最后对各层次上的规则曲面片使用硬件细分着色器绘制,大大提高绘制效率.实验结果表明,文中算法可以高效地绘制细分曲面的极限曲面.     

基于C—C细分的四边形网格上插值光滑Bezier曲面的生成

在任意拓扑的四边形网格上构造光滑的曲面是计算机辅助几何设计中的一个重要问题．基于C—C细分,提出一种从四边形网格上生成插值网格顶点的光滑Bezier曲面片的算法．将输入四边形网格作为C—C细分的初始控制网格,在四边形网格的每张面上对应得到一张Bezier曲面,使Bezier曲面片逼近C—C细分极限曲面．曲面片在与奇异顶点相连的边界上G^1连续,其他地方C^2连续．为解决C—C细分的收缩问题,给出了基于误差控制的迭代扩张初始控制网格的方法,使从扩张后网格上生成的曲面插值于初始控制网格的顶点．实验结果表明,该算法效率高,生成的曲面具有较好的连续性,适用于对四边化后的网格模型上重建光滑的曲面．     

散乱数据点的三次多项式插值

用分片三次多项式曲面对散乱分布数据点插值的方法把给定区域划分成三角形网格，在每个三角形上构造一个三次多项式曲面片，整体的Ｃ１曲面由各三角形上的曲面片拼合而成．讨论了整体Ｃ１曲面需满足的条件组成的方程组的性质，并给出了求解方程组的方法．插值方法的多项式准确集包括所有三次和小于三次的多项式．     

带有形状参数的Bézier三角曲面片

给出了含有参数的二元(n+1)次多项式基函数,是三角域上二元n次Bernstein基函数的扩展;分析了该组基的性质并定义了带有形状参数的(n+1)次Bézier三角曲面片.该曲面不仅具有n次Bézier三角曲面片的特性,而且具有形状的可调性;其参数有明确的几何意义,参数越大,曲面越逼近控制网格;当参数为0时,曲面可退化为n次Bézier三角曲面片.     

Catmull-Clark细分曲面的正则性

针对Catmull-Clark(C-C)细分曲面的正则性进行研究,得到简单易用的判别C-C细分曲面正则性的充分条件.首先给出网格点差分向量的3种定义:前向差分向量,中心差分向量和后向差分向量;然后推导出C-C细分曲面的差分向量的细分格式;进一步,通过特征分析建立了C-C细分极限曲面的切向量与初始控制网格差分向量之间的关系;最后得到判别C-C细分极限曲面正则性的一个充分条件.由于该判别条件表达为初始控制网格差分向量之间的几何关系,因此这个条件具有明显的几何意义.实验结果表明,文中的判别条件易于验证.     

三向四次箱样条曲面的差分界

研究了三向四次箱样条曲面与控制网格中心三角平面片间的距离和该距离的界.借助三向四次箱样条曲面的分片表示,应用该曲面片控制顶点的一阶和二阶方向差分,给出了该曲面片与控制网格中心三角平面片之间的逐点距离.通过该距离的分片表达式,给出了该距离的界.     

基于laplacian坐标修正的3~(1/2)细分法

根据原始网格对细分极限曲面的影响分析,提出了基于laplacian坐标修正的3~(1/2)插值网格细分方法。通过插值出面片中心点的laplacian坐标,来对动态生成的中心点进行修正,达到保持原始网格细节的目的。在非封闭网格的边界面片细分方面,指出了原始3~(1/2)细分法的不足,提出了一种新的边界统一细分模式,它可以很好地控制边界面片的增长,而且具有稳定性和易于操作性。实验结果表明,该方法不仅能够让原始网格的细节在极限曲面上得到表达,而且可以得到一个连续光滑的曲面网格。     

基于新型Gregory三角面片的G1连续曲面拼接

为有效解决构造光滑曲面的三角网格插值问题,将Gregory四边形面片的易控性嫁接到Bézier三角面片上,提出一种新型双三次Gregory三角面片的插值模型.因为公共边界处的G1连续仅取决于2个相邻三角面片的控制点或向量,而无其它连续性限制,所以,该方法可有效消除使用Gregory四边形面片时需分割三角域产生的扭曲现象.实验结果表明,使用该模型对给定的三角网格进行插值,总能生成G1连续的光滑曲面.     

非均匀B样条曲面顶点及法向插值

本文以非均匀Catmull-Clark细分模式下的轮廓删除法为基础,通过在细分网格中定义模板并调整细分网格的顶点位置,为非均匀B样条曲面顶点及法向插值给出了一个有效的方法．该细分网格由待插顶点形成的网格细分少数几次而获得．细分网格的顶点被分为模板内的顶点和自由顶点．各个模板内的顶点通过构造优化模型并求解进行调整,自由顶点用能量优化法确定．这一方法不仅避免了求解线性方程组得到控制顶点的过程,而且在调整顶点的同时也兼顾了曲面的光顺性．     

Filling N-Sided Regions by Quad Meshes for Subdivision Surfaces

Given an n-sided region bounded by a loop of n polylines, we present a general algorithm to fill such a region by a quad mesh suitable for a subdivision scheme. Typically, the approach consists of two phases: the topological phase and the geometrical phase. In the first part, the connectivity of the mesh is based on determining a partitioning of the region into rectangular subregions across which regular grid could be constructed. The geometrical phase generalizes discrete Coon's patches to position the vertices in the 3D space. The generated mesh could be taken as input to any quad-based subdivision scheme, such as that of Catmull–Clark or Doo–Sabin to generate the corresponding limit surface. The goal of the algorithm is to generate smooth meshes with minimum number and less valence of extraordinary vertices deemed undesirable in such subdivision schemes.     

Blending Parametric Patches with Subdivision Surfaces

In this paper the problem of blending parametric surfaces using subdivision patches is discussed. A new approach, named removing-boundary, is presented to generate piecewise-smooth subdivision surfaces through discarding the outmost quadrilaterals of the open meshes derived by each subdivision step. Then the approach is employed both to blend parametric bicubic B-spline surfaces and to fill n-sided holes. It is easy to produce piecewise-smooth subdivision surfaces with both convex and concave corners on the boundary, and limit surfaces are guaranteed to be C2 continuous on the boundaries except for a few singular points by the removing-boundary approach. Thus the blending method is very efficient and the blend-ing surface generated is of good effect.     

曲线插值约束的LOOP细分曲面

提出基于Loop细分方法的曲线插值方法,不需要修改细分规则,只需以插值曲线的控制多边形为中心多边形,向其两侧构造对称三角网格带,该对称三角网格带将收敛于插值曲线。因此,包含有该三角网格带的多面体网格的极限曲面将经过插值曲线。若要插值多条相交曲线只需在交点处构造全对称三角网格。运用该方法可在三角网格生成的细分曲面中插值多达六条的相交曲线。     

Displaced subdivision surfaces of animated meshes

This paper proposes a novel technique for converting a given animated mesh into a series of displaced subdivision surfaces. Instead of independently converting each mesh frame in the animated mesh, our technique produces displaced subdivision surfaces that share the same topology of the control mesh and a single displacement map. We first propose a conversion framework that enables sharing the same control mesh topology and a single displacement map among frames, and then present the details of the components in the framework. Each component is specifically designed to minimize the shape conversion errors that can be caused by enforcing a single displacement map. The resulting displaced subdivision surfaces have a compact representation, while reproducing the details of the original animated mesh. The representation can also be used for efficient rendering on modern graphics hardware that supports accelerated rendering of subdivision surfaces.     

任意拓扑网的细分改进

在改进任意拓扑网构造光滑表面时,初始控制网格确定的情况下,生成的曲面形状惟一确定,最终的物体造型也随之确定,不具有可调性,因而在曲面细分过程中引入了控制参数和摄动。通过引入控制参数,调节一个参数值,使得所得的细分曲面的表达度可控,可以得到一系列的细分曲面。引入摄动是为了改进了空间位置,允许局部地调控约束曲面的形状。最后给出了曲面设计的实例,表明这种算法简单、有效。     

C-C细分曲面的交互形状修改

为了增强细分曲面的造型功能,讨论了C-C细分曲面的交互形状修改算法。通过实时建立局部坐标系定义C-C细分曲面上点、法向量和局部等参数线等约束并将其转化为对控制顶点的约束,得到全局线性系统,从而可以在满足不同类型的几何约束时修改曲面的形状。基于最小二乘法和能量优化法给出两种修改算法,前者可以保持控制顶点扰动量的总和最小,运行速度快,适合于局部、精确调整;后者利用罚函数法给出了能量极小意义下的最优解,适合于保持光顺性要求的全局修改。两种方法都可以利用广义逆矩阵求得显式解,具有可逆性、可交换性、结合性等优点,提高了曲面形状修改的效率和可控性。     

Conjugate-Gradient Progressive-Iterative Approximation for Loop and Catmull-Clark Subdivision Surface Interpolation

Loop and Catmull-Clark are the most famous approximation subdivision schemes, but their limit surfaces do not interpolate the vertices of the given mesh. Progressive-iterative approximation (PIA) is an efficient method for data interpolation and has a wide range of applications in many fields such as subdivision surface fitting, parametric curve and surface fitting among others. However, the convergence rate of classical PIA is slow. In this paper, we present a new and fast PIA format for constructing interpolation subdivision surface that interpolates the vertices of a mesh with arbitrary topology. The proposed method, named Conjugate-Gradient Progressive-Iterative Approximation (CG-PIA), is based on the Conjugate-Gradient Iterative algorithm and the Progressive Iterative Approximation (PIA) algorithm. The method is presented using Loop and Catmull-Clark subdivision surfaces. CG-PIA preserves the features of the classical PIA method, such as the advantages of both the local and global scheme and resemblance with the given mesh. Moreover, CG-PIA has the following features. 1) It has a faster convergence rate compared with the classical PIA and W-PIA. 2) CG-PIA avoids the selection of weights compared with W-PIA. 3) CG-PIA does not need to modify the subdivision schemes compared with other methods with fairness measure. Numerous examples for Loop and Catmull-Clark subdivision surfaces are provided in this paper to demonstrate the efficiency and effectiveness of CG-PIA.     

Generating subdivision surfaces from profile curves

The construction of freeform models has always been a challenging task. A popular approach is to edit a primitive object such that its projections conform to a set of given planar curves. This process is tedious and relies very much on the skill and experience of the designer in editing 3D shapes. This paper describes an intuitive approach for the modeling of freeform objects based on planar profile curves. A freeform surface defined by a set of orthogonal planar curves is created by blending a corresponding set of sweep surfaces. Each of the sweep surfaces is obtained by sweeping a planar curve about a computed axis. A Catmull-Clark subdivision surface interpolating a set of data points on the object surface is then constructed. Since the curve points lying on the computed axis of the sweep will become extraordinary vertices of the subdivision surface, a mesh refinement process is applied to adjust the mesh topology of the surface around the axis points. In order to maintain characteristic features of the surface defined with the planar curves, sharp features on the surface are located and are retained in the mesh refinement process. This provides an intuitive approach for constructing freeform objects with regular mesh topology using planar profile curves.     

A bound on the distance between Loop subdivision surface and its control mesh

By means of direct analysis of the connection between Loop subdivision surface and its control mesh and the computation of the basis functions,we obtain a bound on the distance between Loop subdivision surface patch and its control mesh.The bound can be used to compute the numbers of subdivision for a given tolerance.Finally,two examples are listed in this paper to demonstrate the applications of the bound.