Approximation of conic section by quartic Bzier curve with endpoints continuity condition

A new method for approximation of conic section by quartic B′ezier curve is presented, based on the quartic B′ezier approximation of circular arcs. Here we give an upper bound of the Hausdorff distance between the conic section and the approximation curve, and show that the error bounds have the approximation order of eight. Furthermore, our method yields quartic G2 continuous spline approximation of conic section when using the subdivision scheme,and the effectiveness of this method is demonstrated by some numerical examples.     

The cubic trigonometric Bézier curve with two shape parameters

A cubic trigonometric Bézier curve analogous to the cubic Bézier curve, with two shape parameters, is presented in this work. The shape of the curve can be adjusted by altering the values of shape parameters while the control polygon is kept unchanged. With the shape parameters, the cubic trigonometric Bézier curves can be made close to the cubic Bézier curves or closer to the given control polygon than the cubic Bézier curves. The ellipses can be represented exactly using cubic trigonometric Bézier curves.     

平面有理Bzier曲线的几何包络性质

平面三次有理参数曲线段的形状控制问题,已圆满解决.本文讨论一般平面有理参数曲线的几何性质,给出曲线为凸的充分条件;同时也研究了曲线的包络性质,从几何角度给出平面有理曲线的定义.     

Direction monotonicity for a rational Bézier curve

The monotonicity of a rational Bézier curve, usually related to an explicit function,is determined by the used coordinate system. However, the shape of the curve is independent of the coordinate system. To meet the affine invariant property, a kind of generalized monotonicity, called direction monotonicity, is introduced for rational Bézier curves. The direction monotonicity is applied to both planar and space curves and to both Cartesian and affine coordinate systems, and it includes the traditional monotonicity as a subcase. By means of it,proper affine coordinate systems may be chosen to make some rational Bézier curves monotonic.Direction monotonic interpolation may be realized for some of the traditionally nonmonotonic data as well.     

Bézier form of dual bivariate Bernstein polynomials

Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining Bézier form of the L ₂-solution of the problem of best polynomial approximation of Bézier curve or surface. In this connection, the Bézier coefficients of dual Bernstein polynomials are to be evaluated at a reasonable cost. In this paper, a set of recurrence relations satisfied by the Bézier coefficients of dual bivariate Bernstein polynomials is derived and an efficient algorithm for evaluation of these coefficients is proposed. Applications of this result to some approximation problems of Computer Aided Geometric Design (CAGD) are discussed.     

Bzier曲线和曲面包围的面积和体积算法

§1.引言 曲线、曲面造型和立体造型的理论和方法是迅速发展的 CAD/CAM技术的重要基础之一.在造船、航空、汽车、模具、机械和建筑等行业的CAD系统中,经常需要计算平面上闭曲线包围的面积以及三维立体图形的表面积和体积.     

平面Bzier曲线的凸性定理的一个证明

平面Bzier曲线的凸性定理是计算几何中一个重要的定理.最近,苏步青、刘鼎元在[1,2]中给出了凸性定理的证明. 本文的目的是从Bezier曲线的一阶导矢与二阶导矢的几何作图出发,给出凸性定理的另一个证明.     

Degenerations of rational Bézier surface with weights in the form of exponential function

Rational Bézier surface is a widely used surface fitting tool in CAD. When all the weights of a rational Bézier surface go to infinity in the form of power function, the limit of surface is the regular control surface induced by some lifting function, which is called toric degenerations of rational Bézier surfaces. In this paper, we study on the degenerations of the rational Bézier surface with weights in the exponential function and indicate the difference of our result and the work of Garc′?a-Puente et al. Through the transformation of weights in the form of exponential function and power function, the regular control surface of rational Bézier surface with weights in the exponential function is defined, which is just the limit of the surface.Compared with the power function, the exponential function approaches infinity faster, which leads to surface with the weights in the form of exponential function degenerates faster.     

Verifying the Implicitization Formulae for Degree N Rational Bézier Curves

This is a continuation of short communication$^{[1]}$. In [1] a verification of the implicitization equation for degree two rational Bézier curves is presented which does not require the use of resultants. This paper presents these verifications in the general cases, i.e., for degree $n$ rational Bézier curves. Thus some interesting interplay between the structure of the $n×n$ implicitization matrix and the de Casteljau algorithm is revealed.     

C-Bézier曲线降阶的B网扰动和约束优化法

基于B网扰动和约束优化方法,对n次C-Bézier曲线控制多边形顶点进行扰动,并找到其退化为n-1次次C-Bézier曲线的条件.在满足退化条件的约束下,使n次C-Bézier曲线控制多边形顶点扰动量最小,由此找到降阶为n-1次的C-Bézier曲线,同时也研究了在C~0,C~1连续条件下对n次C-Bézier曲线降阶的B网扰动和约束优化方法.给出了扰动显示格式计算方法和降阶逼近的误差估计式.     

Construction of Bézier Surfaces from Prescribed Boundary

In this paper, we present a method for generating Bézier surfaces from the boundary information based on a general second order functional and a third order functional associated with the triharmonic equation. By solving simple linear equations, the internal control points of the resulting Bézier surface can be obtained as linear combinations of the given boundary control points. This is a generalization of previous works on Plateau-Bézier problem, harmonic, biharmonic and quasi-harmonic Bézier surfaces. Some representative examples show the effectiveness of the presented method.     

On multivariate polynomials in Bernstein–Bézier form and tensor algebra

The Bernstein–Bézier representation of polynomials is a very useful tool in computer aided geometric design. In this paper we make use of (multilinear) tensors to describe and manipulate multivariate polynomials in their Bernstein–Bézier form. As an application we consider Hermite interpolation with polynomials and splines.     

Multiple Degree Reduction and Elevation of Bézier Curves Using Jacobi–Bernstein Basis Transformations

In this article, we find the optimal r times degree reduction of Bézier curves with respect to the Jacobi-weighted L ₂-norm on the interval [0, 1]. This method describes a simple and efficient algorithm based on matrix computations. Also, our method includes many previous results for the best approximation with L ₁, L ₂, and L _∞-norms. We give some examples and figures to demonstrate these methods.     

Polynomial approximation of rational Bézier curves with constraints

We present an efficient method to solve the problem of the constrained least squares approximation of the rational Bézier curve by the polynomial Bézier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials, and exploits their recursive properties. Examples are given, showing the effectiveness of the algorithm.     

Poincaré series of divisorial filtration corresponding to a curve with one place at infinity

The exceptional divisor component of the projective plane modified by a sequence of blow-ups determines filtration on the ring of polynomials in two variables. The set of such components determines the multi-index filtration on this ring. The Poincaré series of this filtration is calculated for some sets of components provided that the modification under study is the minimal resolution of a plane algebraic curve with one place at infinity.     

How do coalitions get built? Evidence from an extensive form coalition game with and without communication

In the laboratory, we investigate a non-cooperative three-person coalition game with externalities and the opportunity to extend existing coalitions. One bargainer, the builder, can propose and build a coalition over two stages. We examine the hypothesis that both absolute and relative payoffs affect the coalition formation process (and outcome). We observe many inefficient two-person final coalitions, and that the distribution of outcomes is sensitive to the constellation of both absolute and relative payoffs. Relative payoffs appear to be applied more myopically than has been observed in bilateral sequential bargaining games or suggested by social preference models. We hypothesize that the prevalence of two-person coalitions stems from builder’s uncertainty about individual acceptance thresholds. In fact, allowing nonbinding communication among the bargainers increases the prevalence of efficient coalitions. The main implication is that efficient coalition building involves strategies for mitigating the strategic uncertainty inherent in building coalitions.     

Asymptotic coupling and a general form of Harris�� theorem with applications to stochastic delay equations

There are many Markov chains on infinite dimensional spaces whose one-step transition kernels are mutually singular when starting from different initial conditions. We give results which prove unique ergodicity under minimal assumptions on one hand and the existence of a spectral gap under conditions reminiscent of Harris?? theorem. The first uses the existence of couplings which draw the solutions together as time goes to infinity. Such ??asymptotic couplings?? were central to (Mattingly and Sinai in Comm Math Phys 219(3):523?C565, 2001; Mattingly in Comm Math Phys 230(3):461?C462, 2002; Hairer in Prob Theory Relat Field 124:345?C380, 2002; Bakhtin and Mattingly in Commun Contemp Math 7:553?C582, 2005) on which this work builds. As in Bakhtin and Mattingly (2005) the emphasis here is on stochastic differential delay equations. Harris?? celebrated theorem states that if a Markov chain admits a Lyapunov function whose level sets are ??small?? (in the sense that transition probabilities are uniformly bounded from below), then it admits a unique invariant measure and transition probabilities converge towards it at exponential speed. This convergence takes place in a total variation norm, weighted by the Lyapunov function. A second aim of this article is to replace the notion of a ??small set?? by the much weaker notion of a ??d-small set,?? which takes the topology of the underlying space into account via a distance-like function d. With this notion at hand, we prove an analogue to Harris?? theorem, where the convergence takes place in a Wasserstein-like distance weighted again by the Lyapunov function. This abstract result is then applied to the framework of stochastic delay equations. In this framework, the usual theory of Harris chains does not apply, since there are natural examples for which there exist no small sets (except for sets consisting of only one point). This gives a solution to the long-standing open problem of finding natural conditions under which a stochastic delay equation admits at most one invariant measure and transition probabilities converge to it.     

Compactness of Composition Operators from the Bloch Space B to QK Spaces

Suppose that φ is an analytic self-map of the unit disk Δ. We consider compactness of the composition operator Cφ from the Bloch space B into the spaces QK defined by a nonnegative, nondecreasing function K（r） for 0 ≤ r 〈 Cφ. Our compactness condition depends only on Φ which can be considered as a slight improvement of the known results. The compactness of Cφ from the Dirichlet space D into the spaces QK is also investigated,     

Cyclic and simultaneous iterative methods to matrix equations of the form A i X B i = F i

This paper deals with a general type of linear matrix equation problem. It presents new iterative algorithms to solve the matrix equations of the form A _i X?B _i = F _i . These algorithms are based on the incremental subgradient and the parallel subgradient methods. The convergence region of these algorithms are larger than other existing iterative algorithms. Finally, some experimental results are presented to show the efficiency of the proposed algorithms.