六点Binary逼近细分法

提出了一种新的细分算法——六点Binary逼近细分法.利用生成多项式等方法对细分法的一致收敛性和Ck连续性进行了分析,通过对细分法中张力参数μ的不同取值,极限曲线可达到C~0~C~7连续.特别是当μ=11/1024时,极限曲线可达到C9连续.数值算例表明,该方法是合理有效的.     

五点二重融合型细分法

提出了一种新的细分算法——五点二重融合型细分法.利用生成多项式对该细分法的一致收敛性和C~k连续性进行了分析,通过对融合型细分法中参数的不同取值,可以分别生成C~1～C~6连续的极限曲线.数值实例表明,与现有一些格式相比,细分算法生成的极限曲线不仅可以保持较高光滑性,并且更接近初始控制多边形.     

构造曲线的插值型细分法--非均匀四点法

本文提出了一种构造曲线的插值型细分法－非均匀四点法,四点法可作为这个方法的一个特例。用这种方法可以构造出Ｇ＾１连续的插值曲线,该法引入了一些偏移参数来控制细分过程,偏移参数参曲线形状的影响是局部的。     

三进制Loop细分曲面的C~1连续性分析

本文利用计算机代数系统,通过对三进制Loop细分算法的细分矩阵和特征映射的构造与分析,证明Loop给出的掩模设计能够保证细分曲面在奇异点是C1连续的,还给出细分矩阵的次优势特征值的一个取值范围,在此范围内利用三进制Loop细分算法生成的细分曲面都是C1连续的.最后给出一种三进制Loop细分算法的新的边点掩模设计方法,在保证细分曲面是C1连续的前提下,比Loop给出的计算公式更简单,细分算法在奇异点附近收敛更快.     

关于曲线积分、曲面积分的定义

关于曲线积分、曲面积分的定义,在现行的教材中多是将其分为第一型(对弧长、对面积)和第二型(对坐标)分别给出的.这种作法在教学中存在着如下两个主要问题:1.由于分别叙述,且内容大体一致,就显得重复繁琐;2.两个定义采取了不同的定义基础(第一型是对光滑曲线、光滑曲面的,第二型是对有向光滑曲线、有向光滑曲面的)”因而无助于对两类曲线积分、曲面积分的联系的理解.针对这种状况,我们采取了如下两个措施:1.两类曲线积分、曲面积分的定义统一给出,节省了叙述的篇幅;2.将两类曲线积分、曲面积分都分别定义在有向光滑曲线、有向光滑曲面上,使定义基础一致,便于对它们的联系的理解.限于篇幅,本文仅就曲线积分进行讨论.     

二次带形状参数双曲B样条曲线

在空间Ω_5=span{1,sinh t,cosh t,sinh 2t,cosh 2t}上给出了二次带形状参数双曲B样条的基函数.由这组基组成的二次双曲B样条曲线是C~1连续的,同时具有很多与二次B样条曲线类似的性质和几何结构,并且可以精确表示双曲线.在控制多边形固定的情况下,可以通过调节形状参数的大小来进一步调整曲线的形状.     

基于几何连续的AT-β-Spline曲线曲面的构造

为了更好地修改给定的样条曲线曲面,构造了满足几何连续的带两类形状参数的代数三角多项式样条曲线曲面,简称为AT-β-Spline.这种代数三角曲线曲面不仅具有普通三角多项式的性质,而且具有全局的和局部的形状可调性.同时还具备较为灵活的连续性.当两类形状参数在给定的范围内任意取值时,这种带两类形状参数的AT-β-Spline曲线满足一阶几何连续性;如果给定两段相邻曲线段中的两类形状参数满足-1≤α≤1,μ_i=λ_(i+1)或μ_i=λ_i=μ_(i+1)=λ_(i+1)时,则带两类形状参数的AT-β-Spline曲线满足C~1∩G~2连续.另外利用奇异混合的思想,构造了满足C~1∩G~2插值AT-β-Spline曲线,解决曲线反求的几何连续性等问题.同时还给出了旋转面的构造,描述了两类形状参数对旋转面的几何外形的影响;当形状参数取特殊值时,这种AT-β-Spline曲线曲面可以精确地表示圆锥曲线曲面.从实验的结果来看,本文构造的AT-β-Spline曲线曲面是实用的有效的.     

CE-Bézier曲线与二次均匀B样条曲线的拼接

将B样条曲线转换为Bézier曲线,基于Bézier曲线间的光滑拼接的理论,研究了带多形状参数的Bézier曲线(CE-Bézier曲线)与均匀B样条曲线的拼接问题,得出均匀B样条曲线与CE-Bézier曲线的G0,G1,G2光滑拼接条件.在达到拼接条件的前提下,通过改变CE-Bézier曲线的形状参数的数值大小,可以灵活调整拼接曲线的形状.     

一类含参数均匀三角样条插值曲线

基于一类C3连续的三角样条基函数,首先分别构造了含参数α的C2和C3连续的三角样条插值曲线,然后通过在基函数中引入参数λ,构造了含两个参数α,λ的形状可调控插值曲线,通过α,λ的不同取值,可得到一类有较好保凸和保单调效果的插值曲线,最后用图例验证了理论的有效性和正确性.     

一类具有优良性质的五点二重逼近细分格式（英文）

提出了一类带两个形状参数的五点二重逼近细分格式.这类格式具有一些优良的性质:高阶连续性、可调性和多项式再生性质.对于参数的某些取值范围极限曲线可以达到C~k(k=0,1,…,7)连续,分析了一类特殊情况的多项式再生性质.实例表明该格式的有效性和灵活性.     

Statistical and Geometrical Way of Model Selection for a Family of Subdivision Schemes

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.     

CORNER-CUTTING SUBDIVISION SURFACES OF GENERAL DEGREES WITH PARAMETERS

As a corner-cutting subdivision scheme, Lane-Riesefeld algorithm possesses the concise and unified form for generating uniform B-spline curves: vertex splitting plus repeated midpoint averaging. In this paper, we modify the second midpoint averaging step of the Lane-Riesefeld algorithm by introducing a parameter which controls the size of corner cutting, and generalize the strategy to arbitrary topological surfaces of general degree. By adjusting the free parameter, the proposed method can generate subdivision surfaces with flexible shapes. Experimental results demonstrate that our algorithm can produce subdivision surfaces with comparable or even better quality than the other state-of-the-art approaches by carefully choosing the free parameters.     

有理曲线的多项式逼近

利用曲线摄动的思想给出了用多项式曲线逼近有理曲线的一种新方法．其基本步骤是对有理曲线的控制顶点进行摄动，使之产生一多项式曲线，并使摄动误差在某种范数意义之下达到最小．同时，通过适当控制摄动曲线的顶点，使逼近多项式曲线与有理曲线在两端点保持一定的连续性．这一结果可以与细分（ｓｕｂｄｉｖｉｓｉｏｎ）技术结合给出有理曲线的整体光滑的分片多项式逼近．实例表明，在某些情况下本文中的方法要优于传统的Ｈｅｒｍｉｔｅ插值方法及Ｔ．Ｗ．Ｓｅｄｅｒｂｅｒｇ和Ｍ．Ｋａｋｉｍｏｔｏ（１９９１）提出的杂交曲线逼近算法．     

Fractal range of a 3-point ternary interpolatory subdivision scheme with two parameters

In this paper, we analyze the fractal property of Hassan’s 3-point ternary interpolatory subdivision scheme with two parameters. The fractal range of the scheme is obtained and illustrated. Many examples show that the obtained results suggest a clear direction to generate fractal curves and surfaces by using this scheme.     

几何造型的有理矩阵细分方法

Ｍｉｃｃｈｅｌｌｉ,Ｐｒａｕｔｚｓｃｈ给出了一类生成曲线的细分法－矩阵细分方程,但该方法仅能生成多项式类型的曲线,为了弥补其不足,本文提出了有理矩阵细分方法,并证明了其生成曲线的优良性质,例如凸包性,几何不变性,变差缩减性等。     

Scalar and Hermite subdivision schemes

A criterion of convergence for stationary nonuniform subdivision schemes is provided. For periodic subdivision schemes, this criterion is optimal and can be applied to Hermite subdivision schemes which are not necessarily interpolatory. For the Merrien family of Hermite subdivision schemes which involve two parameters, we are able to describe explicitly the values of the parameters for which the Hermite subdivision scheme is convergent.     

ESTIMATING ERROR BOUNDS FOR TERNARY SUBDIVISION CURVES/SURFACES

We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parametrization therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and so on.     

Estimating error bounds for binary subdivision curves/surfaces

We estimate error bounds between binary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parameterizations therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as curve/surface intersection, mesh generation, NC machining, surface rendering and so on.     

A family of Hermite interpolants by bisection algorithms

A two point subdivision scheme with two parameters is proposed to draw curves corresponding to functions that satisfy Hermite conditions on [a, b]. We build two functionsf andf ¹ on dyadic numbers and for some values of the parameters,f is in ¹ withf ¹=f. Examples are provided which show how different the curves can be.     

一类新的细分曲线方法

Subdivision defines a smooth curve or surface as the limit of a sequence of successive refinements based on initial control polygon or grid.Usually the curve refinements is the basis of the corresponding surface rules. In this paper we analyze previous subdivision scheme according to theories about convergence of N.Dyn and M.F Hassan. In terms of binary and ternary subdivision schemes general construction about curve‘s refinements are studied.Two approximating curve subdivision schemes with neighboring four control points are derived,the generating limit curves can both reach the smoothness of C^1 over the initial polygon using the two schemes and the tolerances of them are given according to the method of [7].