有理曲线和曲面的分片多项式逼近

本文利用摄动的思想,以摄动有理曲线（曲面）的系数的无穷模作为优化目标,给出了用多项式曲线（曲面）逼近有理曲线（曲面）的一种新方法．同以前的各种方法相比,该方法不仅收敛而且具有更快的收敛速度,并且可以与细分技术相结合,得到有理曲线与曲面的整体光滑、分片多项式的逼近．     

有理曲线和曲面的分片多项式逼近

本文利用撮动的思想,以摄动有理曲线(曲面)的系数的无穷模怍为优化目标,给出了用多项式曲线(曲面)逼近有理曲线(曲面)的一种新方法．同以前的各种方法相比,该方法不仅收敛而且具有更快的收敛速度,并且可以与细分技术相结合．得到有理曲线与曲面的整体光滑,分片多项式的逼近。     

一类有理Bézier曲线及其求积求导的多项式逼近

用多项式曲线来逼近有理曲线在计算机辅助几何设计(CAGD)系统中可简化求积求导等繁琐的计算.然而,按现有的方法能检验一条已知的有理曲线是否具有收敛的多项式逼近曲线却不易选择适当的权因子来产生能用多项式曲线来加以逼近的有理曲线,即不易做到事先设计;同时,要减少求积、求导的逼近误差只能依靠提高多项式曲线的次数.文中给出一类有理Bézier曲线及其多项式逼近算法较好地克服了这两种缺陷,具有推广应用的价值.     

任意次有理Bezier曲线／面对其控制多边形／网格的整体或局部逼近

本文给出一种利用权因子构造整体或局部逼近控制多边形／网格的有理Ｂｅｚｉｅｒ曲线／面的方法,该法适用于任意次数的有理Ｂｅｚｉｅｒ曲线／面、任意的控制多边形／网络,权因子的选择和逼近度的估计都只依赖于一个参数ｗ．当ｗ→＋∞时,相应的曲线／面可按预定要求整体或局部地逼近其控制多边形／网络,逼近阶为ｏ（１／ｗ）。     

两条连续的有理Bezier曲线的逼近合并

目前多项式 Bézier曲线的逼近合并问题已研究得比较深入 ,而有理 Bézier情形主要还是通过两类多项式 h和 H来降阶逼近 ,但是在工业制造中有重要意义的有理 Bézier曲线的合并问题一直缺乏研究 .本文通过控制点的优化扰动将两连续的满足权约束条件的有理 Bézier曲线转化成新的两有理Bézier曲线 ,使它们符合精确合并条件 ;并将合并得到的同阶有理 Bézier曲线看成是原两曲线的有理逼近     

三次Bézier曲线的快速生成算法

本文给出了一种三次Ｂéｚｉｅｒ曲线的生成算法，在曲线的逐点生成过程中，只用到加减法，故效率极高．而且，此方法可推广到一般多项式或有理参数曲线     

有理Bézier曲线hybrid逼近收敛性

hybrid逼近算法是一种用多项式逼近有理多项式的有效方法,但是这种算法逼近有时会发散.这样讨论它的收敛性条件就变得弥足重要.在前人工作的基础上研究了重新参数化对有理Bézier曲线hybrid逼近收敛性的影响,在权系数的某些假定下,得到了重新参数化后hybrid逼近收敛的充分条件.     

空间有理参数多项式曲线的整数级绘制算法

讨论了空间有理曲线中心投影后导数上界的估计，基于曲线各阶差分的递推计算，给出了空间有理参数多项式曲线的快速绘制算法．算法只用到整数的加减法，效率高．     

空间圆柱螺旋线的NURBS表示

O．引言用B样条方法或B6zier方法来表示自由曲线、曲面，是在CAD／CAM技术中广泛使用的数学手段．但是由于它们都不能精确地表示除抛物线或抛物面以外的圆锥曲线与初等二次曲面，因此近年来，另一种形式的参数样条-一参数有理多项式方法占据了主导地位．非均匀有理B样条（简称NURBS）已被国际标准组织（ISO）于1991年正式颁布为关于工业产品几何定义的STEP国际标准，将其作为定义产品形状的唯一数学方法．越来越多的CAD系统采用NURBS曲线与曲面来建立图形库，研究各种曲线与曲面的NURBS表示无疑是很有意义的．在描述圆锥曲线…     

一种平面保凸插值构造光滑曲线的方法

Ａ．Ｍｅｈａｕｔｅ和Ｆ．Ｕｔｒｅｒａｓ（１９９４）给出了一种平面函数型保凸插值构造光滑曲线的方法（以下简称为Ｍ－Ｕ方法）．本文在利用其方法本质的基础上，给出了一种平面上参数型保凸插值构造光滑曲线的方法，同Ｍｅｈａｕｔｅ和Ｕｔｒｅｒａｓ的方法一样，这里的方法也有局部性．另外这种方法还可以构造平面上的封闭曲线．     

Hybrid polynomial approximation to higher derivatives of rational curves

In this paper, we extend the results published in JCAM volume 214 pp. 163-174 in 2008. Based on the bound estimates of higher derivatives of both Bernstein basis functions and rational Bézier curves, we prove that for any given rational Bézier curve, if the convergence condition of the corresponding hybrid polynomial approximation is satisfied, then not only the l-th (l=1,2,3) derivatives of its hybrid polynomial approximation curve uniformly converge to the corresponding derivatives of the rational Bézier curve, but also this conclusion is tenable in the case of any order derivative. This result can expand the area of applications of hybrid polynomial approximation to rational curves in geometric design and geometric computation.     

Computing curve intersection by homotopy methods

Intersection problems are fundamental in computational geometry, geometric modeling and design and manufacturing applications, and can be reduced to solving polynomial systems. This paper introduces two homotopy methods, i.e. polyhedral homotopy method and linear homotopy method, to compute the intersections of two plane rational parametric curves. Extensive numerical examples show that computing curve intersection by homotopy methods has better accuracy, efficiency and robustness than by the Ehrlich-Aberth iteration method. Finally, some other applications of homotopy methods are also presented.     

On the Convergence of Polynomial Approximation of Rational Functions

This paper investigates the convergence condition for the polynomial approximation of rational functions and rational curves. The main result, based on a hybrid expression of rational functions (or curves), is that two-point Hermite interpolation converges if all eigenvalue moduli of a certainr×rmatrix are less than 2, whereris the degree of the rational function (or curve), and where the elements of the matrix are expressions involving only the denominator polynomial coefficients (weights) of the rational function (or curve). As a corollary for the special case ofr=1, a necessary and sufficient condition for convergence is also obtained which only involves the roots of the denominator of the rational function and which is shown to be superior to the condition obtained by the traditional remainder theory for polynomial interpolation. For the low degree cases (r=1, 2, and 3), concrete conditions are derived. Application to rational Bernstein–Bézier curves is discussed.     

两条连续的有理Bézier曲线的逼近合并

目前多项式 Bézier曲线的逼近合并问题已研究得比较深入 ,而有理 Bézier情形主要还是通过两类多项式 h和 H来降阶逼近 ,但是在工业制造中有重要意义的有理 Bézier曲线的合并问题一直缺乏研究 .本文通过控制点的优化扰动将两连续的满足权约束条件的有理 Bézier曲线转化成新的两有理Bézier曲线 ,使它们符合精确合并条件 ;并将合并得到的同阶有理 Bézier曲线看成是原两曲线的有理逼近     

Application of degree reduction of polynomial Bézier curves to rational case

An algorithmic approach to degree reduction of rational Bézier curves is presented. The algorithms are based on the degree reduction of polynomial Bézier curves. The method is introduced with the following steps: (a) convert the rational Bézier curve to polynomial Bézier curve by using homogenous coordinates, (b) reduce the degree of polynomial Bézier curve, (c) determine weights of degree reduced curve, (d) convert the Bézier curve obtained through step (b) to rational Bézier curve with weights in step (c).     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.     

Rational cubic/quartic Said-Ball conics

In CAGD, the Said-Ball representation for a polynomial curve has two advantages over the Bézier representation, since the degrees of Said-Ball basis are distributed in a step type. One advantage is that the recursive algorithm of Said-Ball curve for evaluating a polynomial curve runs twice as fast as the de Casteljau algorithm of Bézier curve. Another is that the operations of degree elevation and reduction for a polynomial curve in Said-Ball form are simpler and faster than in Bézier form. However, Said-Ball curve can not exactly represent conics which are usually used in aircraft and machine element design. To further extend the utilization of Said-Ball curve, this paper deduces the representation theory of rational cubic and quartic Said-Ball conics, according to the necessary and sufficient conditions for conic representation in rational low degree Bézier form and the transformation formula from Bernstein basis to Said-Ball basis. The results include the judging method for whether a rational quartic Said-Ball curve is a conic section and design method for presenting a given conic section in rational quartic Said-Ball form. Many experimental curves are given for confirming that our approaches are correct and effective.     

Optimal constrained polynomials approximation of hyperbolas based on Lupaş q‐Bézier curves

This paper presents an explicit optimal polynomial for approximating the quadratic Lupaş q‐Bézier curve. We first prove that the quadratic Lupaş q‐Bézier curve represents a hyperbola or a parabola. Then we research the approximation of quadratic Lupaş q‐Bézier curves by polynomials. Since the denominator of quadratic Lupaş q‐Bézier curves is a linear function, the explicit optimal constrained approximation is obtained. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed method.     

曲线造型的本征离散法

本文提出了一种基于弧长和转角这两个本质几何参数的曲线离散造型方法．该方法计算简单，几何意义明显，适用于逼近（拟合）和插值（补角），还可作出一类分形图形．其特点是一切细分操作都在转角关于弧长的对应关系图上进行．