Bézier 曲线的多项式重新参数化检测

研究了一种用于精确检测一条Bézier 曲线的次数是否可以通过多项式重新参数化 降低的算法。该算法对任意一条Bézier 曲线,将重新参数化前后的基函数的关系用方程组的形 式表达,但不需要解方程,而是通过系数表示的金字塔算法直接计算,可以精确求出用于重新 参数化的多项式和降低次数后的Bézier 曲线的控制顶点,并且该重新参数化的多项式在相差一 个线性变换的前提下是唯一的。通过实例应用,该算法运算速度较之前的算法快。     

Blind digital watermarking of rational Bézier and B-spline curves and surfaces with robustness against affine transformations and Möbius reparameterization

We present a blind watermarking scheme for rational Bézier and B-spline curves and surfaces which is shape-preserving and robust against the affine transformations and Möbius reparameterization that are commonly used in geometric modeling operations in CAD systems. We construct a watermark polynomial with real coefficients of degree four which has the watermark as the cross-ratio of its complex roots. We then multiply the numerator and denominator of the original curve or surface by this polynomial, increasing its degree by four but preserving its shape. Subsequent affine transformations and Möbius reparameterization leave the cross-ratio of these roots unchanged. The watermark can be extracted by finding all the roots of the numerator and denominator of the curve or surface: the cross-ratio of the four common roots will be the watermark. Experimental results confirm both the shape-preserving property and its robustness against attacks by affine transformations and Möbius reparameterization.     

参数曲线的最优参数化

利用有理重新参数化的自由度求解参数曲线的最优参数化问题,提出一种度量曲线的参数速度与弧长参数化接近程度的方法.利用该方法求得的最优参数化在曲线的重新参数化曲线族中,参数速度偏离单位速度的最大值达到最小.最后,通过计算实例对该方法与其他算法得到的最优参数化的参数速度进行了比较.     

Gradient refinement methods for optimal impulse control problems

An optimal control problem is considered for a system described by a differential equation with measures; a certain constraint is imposed on the total variation of controlmeasure. Involving the method of discontinuous time reparameterization, an interpretation is performed for the procedures of weak control variation in an auxiliary reduced problem, and new refinement methods are developed for impulsive processes. An example is provided.     

Control improvement method for impulsive systems

An optimal impulsive control problem is considered under constraint on the total impulse of control. In the problem there are conventional bounded controls and vector-valued measures (impulsive control). Based on a needle-shaped variation procedure an algorithm for optimal control of impulsive dynamic systems is elaborated. A discontinuous time reparameterization technique is applied. Control improvement property is established. Convergence analysis is provided.     

Boundary-conformed toolpath generation for trimmed free-form surfaces

In this paper, we adopt a 2D reparameterization procedure to regenerate boundary-conformed toolpaths. Three methods for the 2D reparameterization of trimmed boundaries in parametric space are examined and compared. They are the Coons method, the Laplace method, and a newly developed boundary-blending method. These three methods represent three different approaches to 2D surface parameterization, namely, the algebraic interpolation approach, the partial differential equation approach, and a geometric offsetting approach, respectively. Complete algorithms for surface reparameterization and toolpath generation are developed and implemented. The results showed that the Coons method is relatively simple yet might cause anomalies when the complexities of the boundary are high. The Laplace method is robust but takes relatively more computational time and also has the problem of uneven distribution of iso-parametrics. For the newly developed boundary-blending method, both the computational efficiency and parameterization robustness are quite good, in addition, it alleviates the uneven distribution problem appeared in the Laplace results.     

一种新的复杂动态网络学习控制的自适应同步算法

提出了一种新的具有未知时变参数复杂动态网络同步的自适应学习控制方法.运用重新参数化技术,设计周期时变参数的自适应学习律、常参数的更新律以及自适应控制策略确保同步误差渐近收敛.通过构造复合能量函数给出同步的一个充分条件.最后给出一个复杂网络的例子验证所提方法的有效性.     

论区间B样条曲线的升阶与割角的关系

为了解决区间B样条曲线的升阶理论问题,提出区间控制多边形概念,利用双次B样条基函数证明了区间B样条曲线具有升阶性质;并阐明了区间B样条曲线的升阶就是对其控制多边形的割角过程.最后证明了当升阶次数趋于无穷时,区间B样条曲线的控制多边形收敛到该曲线.     

Approximating a helix segment with a rational Bézier curve

From a differential geometric point of view a helix segment can be considered as a spatial generalization of a circular arc. Thus for problems of shape preservation and geometric modelling an approximate rational representation of a helix segment is of interest. In this paper rational Bézier curves of degree 4, 5 and 6 are presented that approximate a helix segment. The approximants fulfill certain geometric constraints. A generalized degree elevation for rational polynomials in Bézier representation is discussed and used for the construction.     

Degree elevation of unified and extended spline curves

Unified and extended splines （UE-splines）, which unifl and extend polynomial, trigonometric, and hyperbolic B-splines, inherit most properties of B-splines and have some advantages over B-splines. The interest of this paper is the degree elevation algorithm of UE-spline curves and its geometric meaning. Our main idea is to elevate the degree of UE-spline curves one knot interval by one knot interval. First, we construct a new class of basis functions, called bi-order UE-spline basis flmctions which are defined by the integral definition of splines. Then some important properties of bi-order UE-splines are given, especially for tile transformation formulae of the basis functions before and after inserting a knot into the knot vector. Finally, we prove that the degree elevation of UE-spline curves can be interpreted as a process of corner cutting on the control polygons, just as in the manner of B-splines. This degree elevation algorithm possesses strong geometric intuition.     

有理三角曲面的分片线性逼近

有理三角曲面的分片线性逼近在参数曲面的求交、绘制等方面有着重要应用.已有研究主要采用曲面的二阶导矢界来估计逼近误差,而有理曲面的导矢界估计是一项困难的工作.为解决上述问题,利用齐次坐标,给出了一种定义域为任意三角形的有理三角曲面的分片线性逼近算法.该算法有效地避免了有理三角曲面的导矢界估计,并且离散段数可先验地给出.此外,通过重新参数化技术来缩小有理三角Bézier曲面的权因子之间的比值,进一步提高了算法的效率.     

A Multi‐sided Bézier Patch with a Simple Control Structure

A new n‐sided surface scheme is presented, that generalizes tensor product Bézier patches. Boundaries and corresponding cross‐derivatives are specified as conventional Bézier surfaces of arbitrary degrees. The surface is defined over a convex polygonal domain; local coordinates are computed from generalized barycentric coordinates; control points are multiplied by weighted, biparametric Bernstein functions. A method for interpolating a middle point is also presented. This Generalized Bézier (GB) patch is based on a new displacement scheme that builds up multi‐sided patches as a combination of a base patch, n displacement patches and an interior patch; this is considered to be an alternative to the Boolean sum concept. The input ribbons may have different degrees, but the final patch representation has a uniform degree. Interior control points—other than those specified by the user—are placed automatically by a special degree elevation algorithm. GB patches connect to adjacent Bézier surfaces with G¹continuity. The control structure is simple and intuitive; the number of control points is proportional to those of quadrilateral control grids. The scheme is introduced through simple examples; suggestions for future work are also discussed.     

代数双曲B-样条的几何构造

样条曲线的升阶是CAD系统相互沟通必不可少的手段之一.由于双阶样条的升阶算法具有割角性质,因此具有鲜明的几何意义.以代数双曲B-样条为例,证明了样条曲线经过不断升阶之后,其控制多边形序列会像Bézier曲线一样收敛到初始的代数双曲B-样条曲线.利用文中得到的结果,就可以像Bézier曲线一样,通过几何割角法生成B-样条曲线﹑双曲线﹑悬链线等常用曲线.     

Fair, G- and C-continuous circle splines for the interpolation of sparse data points

This paper presents a carefully chosen curve blending scheme between circles, which is based on angles, rather than point positions. The result is a class of circle splines that robustly produce fair-looking G²-continuous curves without any cusps or kinks, even through rather challenging, sparse sets of interpolation points. With a simple reparameterization the curves can also be made C²-continuous. The same method is usable in the plane, on the sphere, and in 3D space.     

Continuous point projection to planar freeform curves using spiral curves

We present an efficient algorithm for projecting a continuously moving query point to a family of planar freeform curves. The algorithm is based on the one-sided Hausdorff distance from the trajectory curve (of the query point) to the planar curves. Using a bounding volume hierarchy (BVH) of the planar curves, we estimate an upper bound [`(h)]\overline{h} of the one-sided Hausdorff distance and eliminate redundant curve segments when they are more than distance [`(h)]\overline{h} away from the trajectory curve. Recursively subdividing the trajectory curve and repeating the same elimination procedure to the BVH of the remaining curves, we can efficiently determine where to project the moving query point. The explicit continuous point projection is then interpreted as a curve reparameterization problem, for which we propose a few simple approximation techniques. Using several experimental results, we demonstrate the effectiveness of the proposed approach.     

Improving the Parameterization of Approximate Subdivision Surfaces

We provide a method for improving the parameterization of patching schemes that approximate Catmull‐Clark subdivision surfaces, such that the new parameterization conforms better to that of the original subdivision surface. We create this reparameterization in real‐time using a method that only depends on the topology of the surface and is independent of the surface's geometry. Our method can handle patches with more than one extraordinary vertex and avoids the combinatorial increase in both complexity and storage associated with multiple extraordinary vertices. Moreover, the reparameterization function is easy to implement and fast.     

Time reparameterization in problems of optimal control of impulsive hybrid systems

We consider an optimal control problem for a hybrid dynamic system, where jumps of a trajectory may occur only at the moments of hitting a given closed subset of an extended phase space. A time reparameterization technique is developed to reduce the original problem to the one with bounded controls. We show that the reparameterized problem is equivalent to optimization in a class of generalized solutions to the hybrid system.     

Bezier曲线到AH-Bezier曲线的升阶算法

关于曲线升阶,已有的结论往往限于同类曲线之间。为了突破这一限制,考虑不同类曲线间的升阶,关注代数多项式空间中的Bezier曲线到代数双曲多项式空间中的AH-Bezier曲线的升阶。研究从基函数入手,利用Bezier和AH-Bezier共有的求导降阶的特点,结合矩阵分块的思想,先给出AH-Bezier基到Bernstein基的转换矩阵,进而推出控制顶点的升阶公式,最后给出升阶算法。结果表明,任意n次Bezier曲线可以通过该算法升到n＋3阶（等同于n＋2次）的AH-Bezier曲线。算法实现了Bezier到AH-B＆#233;zier曲线模型的精确转换。