曲线插值的一种保凸细分方法

为了弥补以四点插值细分方法为代表的线性细分方法在形状控制方面的缺陷,提出一种基于几何的插值型保凸细分方法.细分过程每一步中,每条边所对应的新控制顶点由原控制顶点及其切向共同确定;每点处的切向由其邻近的点所确定,并且随细分过程逐步调整.理论分析表明,该方法的极限曲线是G1连续的保凸曲线.如果所有的初始点取自圆弧段,则极限曲线就是该圆弧段.数值实例表明,采用文中方法得到的曲线较为光顺.     

基于双参数的几何细分法

提出一种基于两个参数的几何细分方法。首先,借助于标准型的二次有理Bézier 曲 线公式,以相邻的两个初始控制点及其切向量所在直线的交点作为该二次有理Bézier 曲线的控制 顶点;同时,选取分点参数值t  0.5,并以该曲线的权因子作为控制顶点的参数λ,计算新增控 制顶点。其次,定义每个顶点的临时切向量,以每点及其相邻两点确定该点的圆切向;引入切向 量的控制参数,从而确定该顶点新切向量的计算公式。然后,从理论上证明了该方法的保凸性 与收敛性。取定切向量参数=0,重新定义每步的权因子参数λ,其极限曲线是C1连续的分段二 次有理Bézier 曲线;令=1,在每一步骤中采用不同的权因子参数λ 求新增点,具有保圆性。最 后,通过一些实例说明了该方法的有效性。     

带法向约束的圆平均非线性细分曲线设计

目的 对采样设备获取的测量数据进行拟合,可实现原模型的重建及功能恢复。但有些情况下,获取的数据点不仅包含位置信息,还包含法向量信息。针对这一问题,本文提出了基于圆平均的双参数4点binary非线性细分法与单参数3点ternary插值非线性细分法。方法 首先将线性细分法改写为点的重复binary线性平均,然后用圆平均代替相应的线性平均,最后用加权测地线平均计算的法向量作为新插入顶点的法向量。基于圆平均的双参数4点binary细分法的每一次细分过程可分为偏移步与张力步。基于圆平均的单参数3点ternary细分法的每一次细分过程可分为左插步、插值步与右插步。结果 对于本文方法的收敛性与C¹连续性条件给出了理论证明;数值实验表明,与相应的线性细分相比,本文方法生成的曲线更光滑且具有圆的再生力,可以较好地实现3个封闭曲线重建。结论 本文方法可以在带法向量的初始控制顶点较少的情况下,较好地实现带法向约束的离散点集的曲线重建问题。     

基于顶点法向量约束的Catmull-Clark细分插值方法

提出一种基于顶点法向量约束实现插值的两步Catmull-Clark细分方法.第一步,通过改造型Catmull-Clark细分生成新网格.第二步,通过顶点法向量约束对新网格进行调整.两步细分分别运用渐进迭代方法和拉格朗日乘子法,使得极限曲面插值于初始控制顶点和法向量.实验结果证明了该方法可同时实现插值初始控制顶点和法向量,极限曲面具有较好的造型效果.     

基于形状控制的细分曲面的局部渐进插值方法

提出一种基于形状控制的 Catmull-Clark 细分曲面构造方法,实现局部插值任意拓扑的四边形网格顶点。首先该方法利用渐进迭代逼近方法的局部性质,在初始网格中选取若干控制顶点进行迭代调整,保持其他顶点不变,使得最终生成的极限细分曲面插值于初始网格中的被调整点;其次该方法的 Catmull-Clark 细分的形状控制建立在两步细分的基础上,第一步通过对初始网格应用改造的 Catmull-Clark 细分产生新的网格,第二步对新网格应用 Catmull-Clark 细分生成极限曲面,改造的 Catmull-Clark 细分为每个网格面加入参数值,这些参数值为控制局部插值曲面的形状提供了自由度。证明了基于形状控制的 Catmull-Clark 细分局部渐进插值方法的收敛性。实验结果验证了该方法可同时实现局部插值和形状控制。     

曲线插值的一种具有还圆性的细分方法

传统的线性四点插值细分方法不能表示圆等非多项式曲线,为了解决这种 问题,基于几何特性提出了一种带有一个参数的四点插值型曲线细分方法。细分过程中,过 相邻三插值点作圆,过相邻二插值点的圆弧有两个中点,将其加权平均得到新插值点,文中 给出了插值公式和算法描述。所给方法具有还圆性,可以实现保凸性。实例分析对比了本方 法与多种细分方法的差异,说明本方法是有效的,当参数取值较小时,曲线靠近控制多边形。     

三次Hermite插值曲线的能量优化

在给定插值点的位置矢量及切矢量的情况下,通过在两相邻节点引入两个新的节点,提出了一类保持[C1]连续的三次Hermite插值曲线的构造方法,分别通过基于曲率、挠率的能量函数对其进行优化,给出了能量最小化的参数取值公式。讨论了参数对曲线形状的影响,实例表明了方法的有效性。     

形状可调的Loop 细分曲面渐进插值方法

针对Loop 细分无法调整形状与不能插值的问题,提出了一种形状可调的Loop 细分 曲面渐进插值方法。首先给出了一个既能对细分网格顶点统一调整又便于引入权因子实现细分曲 面形状可调的等价Loop 细分模板。其次,通过渐进迭代调整初始控制网格顶点生成新网格,运 用本文的两步Loop 细分方法对新网格进行细分,得到插值于初始控制顶点的形状可调的Loop 细分曲面。最后,证明了该方法的收敛性,并给出实例验证了该方法的有效性。     

Subdivision Schemes for Quadrilateral Meshes with the Least Polar Artifact in Extraordinary Regions

This paper presents subdivision schemes with subdivision stencils near an extraordinary vertex that are free from or with substantially reduced polar artifact in extraordinary regions while maintaining the best possible bounded curvature at extraordinary positions. The subdivision stencils are firstly constructed to meet tangent plane continuity with bounded curvature at extraordinary positions. They are further optimized towards curvature continuity at an extraordinary position with additional measures for removing or for minimizing the polar artifact in extraordinary regions. The polar artifact for subdivision stencils of lower valences is removed by applying an additional constraint to the subdominant eigenvalue to be the same as that of subdivision at regular vertices, while the polar artifact for subdivision stencils of higher valances is substantially reduced by introducing an additional thin‐plate energy function and a penalty function for maintaining the uniformity and regularity of the characteristic map. A new tuned subdivision scheme is introduced by replacing subdivision stencils of Catmull‐Clark subdivision with that from this paper for extraordinary vertices of valences up to nine. We also compare the refined meshes and limit surface quality of the resulting subdivision scheme with that of Catmull‐Clark subdivision and other tuned subdivision schemes. The results show that subdivision stencils from our method produce well behaved subdivision meshes with the least polar artifact while maintaining satisfactory limit surface quality.     

用细分螺线插值容许G2Hermite 数据

为使几何细分方法生成的平面螺线段插值平面容许G2Hermite 数据,基于 平面双圆弧插值理论提出了该方法首末端点处新的细分规则。理论分析表明,修改后的细分 方法所得极限曲线是曲率单调、不变号的螺线段,且插值首末端点处的点、切向、曲率。数 值算例表明,修改后的细分方法收敛速度较快,极限曲线具有较好的形状。     

The generation of circular arcs and conics by subdivision via averaging normal vectors

We propose a nonlinear interpolatory curve subdivision based on averaging normal vectors, which can reproduce circular arcs when straight edges exist in the original control polygon and generate conics when initial control points are sampled uniformly. Corresponding proofs and examples are also given for verifying the correctness of this scheme.     

Nonlinear structural analysis via reduced basis technique

A reduced basis technique is presented for predicting a static response of nonlinear structures. The idea of taking a set of correction vectors of the classical Newton-Raphson iterative scheme coupled with the lowest eigenvectors of the updated tangent stiffness matrices, to be the basis vectors, is proposed and proved to be acceptable. The effectiveness of the proposed approach is demonstrated by means of numerical examples.     

A new fast normal-based interpolating subdivision scheme by cubic Bézier curves

In this paper, we propose a new fast normal-based interpolating subdivision scheme for curve and surface design. Different from the 4-points interpolating subdivision scheme, it is based on cubic Bezier curves and the normal vectors are used to generate a circle. Both a convex edge and an inflexion edge can be subdivided into convex sub-edges and then generate smooth curves. Under proper angle conditions, this subdivision scheme converges and the limit curve will be \(\hbox {G}^{1}\) smoothness. When applying it to subdivide surface on triangle/quadrilateral meshes, we use the normal vectors and have no need to consider the meshes neighboring to the current surface elements. Such advantage leads to that the subdivision scheme has fast rendering speed without changing the topology of the meshes. Subdivision examples and results by our scheme are illustrated and meantime is compared with those generated by other well-known schemes. It shows that this scheme can generate a more smooth curve based on both a convex edge and an inflexion edge, and the limit surface has better smoothness than those of other interpolating schemes.     

A subdivision scheme for Poisson curves and surfaces

The de Casteljau evaluation algorithm applied to a finite sequence of control points defines a Bézier curve. This evaluation procedure also generates a subdivision algorithm and the limit of the subdivision process is this same Bézier curve. Extending the de Casteljau subdivision algorithm to an infinite sequence of control points defines a new family of curves. Here, limits of this stationary non-uniform subdivision process are shown to be equivalent to curves whose control points are the original data points and whose blending functions are given by the Poisson distribution. Thus this approach generalizes standard subdivision techniques from polynomials to arbitrary analytic functions. Extensions of this new subdivision scheme from curves to tensor product surfaces are also discussed.     

An Iterative Method for Deciding SVM and Single Layer Neural Network Structures

We present two new classifiers for two-class classification problems using a new Beta-SVM kernel transformation and an iterative algorithm to concurrently select the support vectors for a support vector machine (SVM) and the hidden units for a single hidden layer neural network to achieve a better generalization performance. To construct the classifiers, the contributing data points are chosen on the basis of a thresholding scheme of the outputs of a single perceptron trained using all training data samples. The chosen support vectors are used to construct a new SVM classifier that we call Beta-SVN. The number of chosen support vectors is used to determine the structure of the hidden layer in a single hidden layer neural network that we call Beta-NN. The Beta-SVN and Beta-NN structures produced by our method outperformed other commonly used classifiers when tested on a 2-dimensional non-linearly separable data set.     

基于局部细分构造产品原型的PD-LS算法

将Loop细分原则引入产品设计系统中,提出并设计了一种基于局部细分模型构造产品原型的PD-LS算法。算法利用局部细分原则在产品图形的局部区域上进行迭代插值,经插值细分后,在降低整体网格密度的前提下,致使不同区域特征点密度不同,使重要区域具有较高密度,以此降低产品原型的褶皱度。最后通过仿真实验验证该算法具有较好的性能。     

An iterative/subdivision hybrid algorithm for?curve/curve?intersection

The problem of finding all intersections between two space curves is one of the fundamental problems in computer-aided geometric design and computational geometry. This article proposes a new iterative/subdivision hybrid algorithm for this problem. We use a test based on Kantorovich’s theorem to detect the starting point from which Newton’s method converges quadratically and a subdivision scheme to exclude certain regions that do not contain any intersections. Our algorithm is guaranteed to detect all intersections in the domain for nondegenerate and non-ill-posed cases.     

形状插值的G1 Hermite曲线

提出了在给定2个端点及其切矢方向的条件下生成一条形状较好的三次Hermite曲线的方法.把未知的形状最好曲线的端点切矢模长看作端点条件的函数;然后建立该函数应当满足的条件,并根据工程制图人员在一些特殊的端点条件下的绘图得到一些经验数据;最后把该函数近似用三角函数的二次以下谐波分解表示,根据已有的经验数据和建立的条件得到谐波分量的大小.目标曲线的计算简单,在经验数据的情况下,目标曲线端点切矢模长范围为(0.5,2.9).与已有方法相比,曲线形状较好.     

Loop型半静态细分方法

在拓展四次三方向Box-样条曲面离散定义的基础上,导出了半静态Loop细分方法,并构造了该细分方法的二邻域细分矩阵.通过对细分矩阵特征值的理论分析,证明了文中方法的细分极限曲面收敛且切平面连续.半静态Loop细分方法的细分矩阵随细分次数规则变化,与传统Loop细分方法相比,该方法具有更大的灵活性和更丰富的造型表现能力.