Dual representation of spatial rational Pythagorean-hodograph curves

In this paper, the dual representation of spatial parametric curves and its properties are studied. In particular, rational curves have a polynomial dual representation, which turns out to be both theoretically and computationally appropriate to tackle the main goal of the paper: spatial rational Pythagorean-hodograph curves (PH curves). The dual representation of a rational PH curve is generated here by a quaternion polynomial which defines the Euler–Rodrigues frame of a curve. Conditions which imply low degree dual form representation are considered in detail. In particular, a linear quaternion polynomial leads to cubic or reparameterized cubic polynomial PH curves. A quadratic quaternion polynomial generates a wider class of rational PH curves, and perhaps the most useful is the ten-parameter family of cubic rational PH curves, determined here in the closed form.     

一类加权有理四次插值样条曲线的形状控制

将插值曲线约束于给定的区域之内是曲线形状控制中的重要问题。利用带导数的和不带导数的分母为线性的有理四次插值样条构造了一类新的加权有理四次插值样条函数,插值函数具有简单的显示表示,这类新的插值样条中含有权系数,因而增加了处理问题的灵活性,给约束控制带来了方便。给出了将该种插值曲线约束于给定的折线、二次曲线之上、之下或之间的充分条件。证明了满足约束条件的加权有理样条的存在性。     

一种参数多项式曲面片的逐点生成算法

在计算机绘图中，一般来说，曲线实际上是由折线代替，而曲面实为小平面拼接而成，在使计算量降到最低的情况下画出真正的曲线方面，已有许多文章研究了曲线的逐点生成方法，并取得了一定的进展，但是尚无有效的快速逐点生成曲面的方法，为了快速逐点生成曲面，在建立多项式函数递推计算公式和算法的基础上，给出了一种逐点生成参数多项式曲面片的算法，由于此算法中只用到整数加法运算，且点数的适当选取可使计算量达到极小，因此是一种很有效的算法，该方法还可以加以改进，而用于有理函数，这无疑对有理曲线曲面（如NURBS曲线曲面）的快速生成以及对计算机图形学的其他一些领域都是有意义的。     

加权有理三次样条的形状控制

利用带导数和不带导数的分母为三次的有理三次插值样条构造了一类加权有理三次插值样条函数,由于这种有理三次插值样条中含有参数、调节参数和权系数,因而给约束控制带来了方便。同时只要合适地选择调节参数,就可以使之变成分母为线性的和分母为二次的有理三次插值样条函数。对该样条曲线的区域控制问题进行了研究,给出了将其约束于给定的折线、二次曲线之上、之下或之间的充分条件。最后给出了数值例子。     

Degenerate parametric curves

This paper discusses two degenerate cases of polynomial parametric curves for which the degrees of the defining polynomials can be reduced without altering the curve. The first case is the improperly parametrized curve for which each point on the curve corresponds to several parameter values. The second case, which can only occur for rational polynomial parametric curves, exists when the defining polynomials all have a common factor.

This paper describes how to detect and correct each type of degeneracy. Examples are given which demonstrate that seemingly innocuous Bézier curves may suffer from either of these degeneracies.     

Construction of Bézier surface patches with Bézier curves as geodesic boundaries

Given four polynomial or rational Bézier curves defining a curvilinear rectangle, we consider the problem of constructing polynomial or rational tensor-product Bézier patches bounded by these curves, such that they are geodesics of the constructed surface. The existence conditions and interpolation scheme, developed in a general context in earlier studies, are adapted herein to ensure that the geodesic-bounded surface patches are compatible with the usual polynomial/rational representation schemes of CAD systems. Precise conditions for four Bézier curves to constitute geodesic boundaries of a polynomial or rational surface patch are identified, and an interpolation scheme for the construction of such surfaces is presented when these conditions are satisfied. The method is illustrated with several computed examples.     

Linear subdivision is strictly a polynomial phenomenon

In this paper we give an elementary proof that polynomial curves are the only differentiable curves which permit subdivision by simple linear techniques. Subdivision methods for rational polynomial curves are also discussed.     

From conics to NURBS: A tutorial and survey

The main geometric features of the nonuniform rational B-splines (NURBS) curve and surface representations are described. It is shown that most of these features are already exhibited by conics, which are a special case of NURBS. The properties typical of NURBS are discussed without dwelling on properties already present in polynomial curves. Conic sections and their representations using rational Bezier curves are reviewed. Cubic NURB curves, geometrical rational splines, rational and B-spline surfaces, and rational Bezier triangles are discussed     

Nonexistence of rational rotation-minimizing frames on cubic curves

We prove there is no rational rotation-minimizing frame (RMF) along any non-planar regular cubic polynomial curve. Although several schemes have been proposed to generate rational frames that approximate RMF's, exact rational RMF's have been only observed on certain Pythagorean-hodograph curves of degree seven. Using the Euler–Rodrigues frames naturally defined on Pythagorean-hodograph curves, we characterize the condition for the given curve to allow a rational RMF and rigorously prove its nonexistence in the case of cubic curves.     

参数曲线导矢界估计及在曲线绘制中的应用

对CAGD中常见的多项式曲线和有理多项式曲线的导矢的界提出了新的估计公式.基于这些公式,对参数曲线的逐点绘制法进行了研究,提出了新的插值规则,较好地解决了以往绘制算法中出现的重复绘制问题和不连续性问题.这些结果可以明显地提高曲线造型、求交、逼近、显示和绘制的效率.     

Minimally Generating Ideals of Rational Parametric Curves in Polynomial Time

We present an algorithm for computing a minimal set of generators for the ideal of a rational parametric projective curve in polynomial time. The method exploits the availability of polynomial algorithms for the computation of minimal generators of an ideal of points and is an alternative to the existing Gröbner bases techniques for the implicitization of curves. The termination criterion is based on the Castelnuovo–Mumford regularity of a curve. The described computation also yields the Hilbert function and, hence, the Hilbert polynomial and the Poincaré series of the curves. Moreover, it can be applied to unions of rational curves. We have compared the implementation of our algorithm with the Hilbert driven elimination algorithm included in CoCoA 3.6 and Singular 1.2, obtaining, in general, significant improvements in timings.     

一种基于拟合二阶导数曲线的光顺算法

论文针对目前曲线光顺算法存在的问题,提出在小挠度情况下的利用曲线二阶导数平滑程度来判断曲线光顺性的准则,并在此基础上提出了一种采用最小二乘法来拟合曲线型值点列的二阶差商曲线,然后通过两次积分来反求出光顺曲线思想的曲线光顺算法,并给出了实际的算例来说明该算法的优越性。文中讨论了该方法的误差上界,从而能有效地控制算法在进行光顺时对曲线型值点的移动范围。     

Curve Evaluation and Interrogation on Surfaces

This paper presents a coherent computational framework to efficiently, and more so robustly, evaluate, interrogate, and compute a whole variety of characteristic curves on freeform parametric rational surfaces represented as (piecewise) polynomial or rational functions. These characteristic curves are expressed as zero sets of bivariate rational functions and include silhouette curves and isoclines from a prescribed viewing direction and/or point, reflection lines and reflection ovals, and highlight lines. This zero set formulation allows for a better treatment of singular cases while these characteristic curves are crucial for various applications, from visualization through interrogation to design and manufacturing.     

Automatic parameterization of rational curves and surfaces III: Algebraic plane curves

We present algorithms to compute the genus and rational parametric equations, for implicitly defined irreducible plane algebraic curves of arbitrary degree. Rational parameterizations exist for all irreducible algebraic curves of genus 0. The genus is computed by a complete analysis of the singularities of plane algebraic curves, using affine quadratic transformations. The rational parameterization techniques, essentially, reduce to solving symbolically systems of homogeneous linear equations and the computation of polynomial resultants.     

Application of Taylor series in obtaining the orthogonal operational matrix

In this research first we explicitly obtain the relation between the coefficients of the Taylor series and Jacobi polynomial expansions. Then we present a new method for computing classical operational matrices (derivative, integral and product) for general Jacobi orthogonal functions (polynomial and rational). This method can be used for many classes of orthogonal functions.     

Rational general solutions of planar rational systems of autonomous ODEs

In this paper, we provide an algorithm to compute explicit rational solutions of a rational system of autonomous ordinary differential equations (ODEs) from its rational invariant algebraic curves. The method is based on the proper rational parametrization of these curves and the fact that by linear reparametrizations, we can find the rational solutions of the given system of ODEs. Moreover, if the system has a rational first integral, we can decide whether it has a rational general solution and compute it in the affirmative case.     

Automatic parameretization of rational curves and surfaces 1: conics and conicoids

Given the implicit equation for degree two curves (conics) and degree two surfaces (conicoids), algorithms are described here, which obtain their corresponding rational parametric equations (a polynomial divided by another). These rational parameterizations are considered over the fields of rationals, reals and complex numbers. In doing so, solutions are given to important subproblems of finding rational and real points on the given conic curve or conicoid surface. Further polynomial parameterizations are obtained whenever they exist for the conics or conicoids. These algorithms have been implemented on a VAX-780 using VAXIMA.     

运用多项式曲线在多项式曲面上裁剪Bézier曲面

在多项式曲面的定义域上,以两多项式曲线及两直线段围成的简单区域作为裁剪区域,运用参数变换将该区域变换到标准正方形区域,以多项式开花为工具,将裁剪区域对应的子曲面片表示成Bézier曲面形式。对于参数平面上的复杂裁剪区域,则分割为若干简单区域来进行。该裁剪算法能处理形状较为复杂的曲面裁剪,方法对任意多项式曲面适用,而且能推广到有理情况。     

Design of steady-state minimum variance controllers

A new technique to design optimal controllers is presented for plants described by rational transfer functions and additive disturbances with rational spectral densities. The objective is to minimize a weighted sum of the plant input and output steady-state variances subject to asymptotic stability of the closed-loop system.The technique is based on polynomial algebra. In fact, the design procedure is reduced to solving two linear polynomial equations whose unique solution directly yields the optimal controller transfer function as well as the minimized cost. This approach is simple, computationally attractive, and can handle unstable and/or nonminimum-phase plants with improper transfer functions.An integral part of the paper are effective computational algorithms, which include the spectral factorization, the solution of polynomial equations, and the evaluation of minimum cost.     

多项式混合曲线曲面方法构造

针对混合曲线表示及其求导和求积困难的问题,通过计算构造出一种多项式混合曲线曲面形式.当待混合曲线是多项式时,混合曲线也为多项式形式.该多项式混合公式可以推广得到任意参数连续C(n)和几何连续G(n)的混合曲线曲面.另外,在得到的混合曲线曲面族中构造出了新的更优能量光顺方程,通过设置参数可得到合适的混合曲线曲面.实验结果表明,文中提出的混合曲线曲面造型方法稳定、有效.