Judging or setting weight steady-state of rational Bezier curves and surfaces

Many works have investigated the problem of reparameterizing rational B~zier curves or surfaces via MSbius transformation to adjust their parametric distribution as well as weights, such that the maximal ratio of weights becomes smallerthat some algebraic and computational properties of the curves or surfaces can be improved in a way. However, it is an indication of veracity and optimization of the reparameterization to do prior to judge whether the maximal ratio of weights reaches minimum, and verify the new weights after MSbius transfor- mation. What＇s more the users of computer aided design softwares may require some guidelines for designing rational B6zier curves or surfaces with the smallest ratio of weights. In this paper we present the necessary and sufficient conditions that the maximal ratio of weights of the curves or surfaces reaches minimum and also describe it by using weights succinctly and straightway. The weights being satisfied these conditions are called being in the stable state. Applying such conditions, any giving rational B6zier curve or surface can automatically be adjusted to come into the stable state by CAD system, that is, the curve or surface possesses its optimal para- metric distribution. Finally, we give some numerical examples for demonstrating our results in important applications of judging the stable state of weights of the curves or surfaces and designing rational B6zier surfaces with compact derivative bounds.     

THE RELATIONSHIP BETWEEN PROJECTIVE GEOMETRIC AND RATIONAL QUADRATIC B-SPLINE CURVES

For two rational quadratic B-spline curves with same control vertexes, the cross ratio of four eollinear points are represented; which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the twocurves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Beeier curves, the value is generally related with the loeation of the ray, and the necessary and sufficient condition o5 the ratio being independent of the ray‘s loeation is showed. Alsn another cross ratio o5 the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initlal vertex intersects respectivdy with the curve segmentt the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only whh the ray‘s location, butnot with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments.     

Judging or setting weight steady-state of rational Bézier curves and surfaces

Many works have investigated the problem of reparameterizing rational Bézier curves or surfaces via Mbius transformation to adjust their parametric distribution as well as weights, such that the maximal ratio of weights becomes smallerthat some algebraic and computational properties of the curves or surfaces can be improved in a way. However, it is an indication of veracity and optimization of the reparameterization to do prior to judge whether the maximal ratio of weights reaches minimum, and verify the new weights after Mbius transformation. What's more the users of computer aided design softwares may require some guidelines for designing rational Bézier curves or surfaces with the smallest ratio of weights. In this paper we present the necessary and sufficient conditions that the maximal ratio of weights of the curves or surfaces reaches minimum and also describe it by using weights succinctly and straightway.The weights being satisfied these conditions are called being in the stable state. Applying such conditions, any giving rational Bézier curve or surface can automatically be adjusted to come into the stable state by CAD system, that is, the curve or surface possesses its optimal parametric distribution. Finally, we give some numerical examples for demonstrating our results in important applications of judging the stable state of weights of the curves or surfaces and designing rational Bézier surfaces with compact derivative bounds.     

Geometric meanings of the parameters on rational conic segments

Using algebraic and geometric methods,functional relationships between a point on a conic segment and its corresponding parameter are derived when the conic segment is presented by a rational quadratic or cubic Bézier curve.That is,the inverse mappings of the mappings represented by the expressions of rational conic segments are given.These formulae relate some triangular areas or some angles,determined by the selected point on the curve and the control points of the curve,as well as by the weights of the rational Bézier curve.Also,the relationship can be expressed by the corresponding parametric angles of the selected point and two endpoints on the conic segment,as well as by the weights of the rational Bézier curve.These results are greatly useful for optimal parametrization,reparametrization,etc.,of rational Bézier curves and surfaces.     

Approximate merging of B-spline curves and surfaces

Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.     

代数等距曲线、曲面的有理性质

A simple method is developed to identify the rationality of offsets to algebraic curves and surfaces which are given either implicitly or parametrically and to parametrize the offsets if they are rational. In particular, we show that offsets to ellipses and hyperbolas are of nonzero genus except for the circles, and somewhat surprisingly, that offsets to paraboioids and hyperboioids with one sheet can all be rationally parametrtised.     

A REMARK ON IMPLICITIZING RATIONAL CURVES WITH BASE POINTS

A simple relationship between the Bezout matrix corresponding to a rational curve with base points and the Bezout matrix corresponding to the same rational curve except that whose base points are eliminated is clarified. Based on this relationship,the author proves that the implicit equation of a rational curve with base points is the largest rton-zero leading principal minor of the gezout resultant corresponding to the rational curve assuming that the rational curve doesn‘t have triva/base point 0,and thus provides a simple approach to Jmplicitze rational curves with base points. Furthermore，as a by-product ，art algorithm is presented to compute the base points of a rational curve.     

ANOTHER TYPE OF GENERALIZED BALL CURVES AND SURFACES

In 2000,Wu presented two new types of generalized Ball curves,one of which is called an NB1 curve located between the Wang Ball curve and the Said Ball curve.In this article,the authors aim to discuss properties of NB1 curves and surfaces,including the recursive algorithms,conversion algorithms between NB1 and Bézier curves and surfaces, etc.In addition the authors compare the computation efficiency of recursive algorithms for the NB1 and above mentioned two generalized Ball curves and surfaces.     

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.     

UNIFYING REPRESENTATION OF BEZIERCURVE AND GENERALIZED BALL CURVES

Abstract. This paper presents two new families of the generalized Ball curves which include theI~zier curve, the generalized Ball curves defined by Wang and Said independently and some in-termediate curves. The relative degree elevation and reduction schemes, recursive algorithmsand the Bernstein-Bezier representation are also given.     

Rational B-splines with prescribed poles

A recursion formula for rational B-splines with prescribed poles is given that reduces to DeBoor's recursion when all poles are at infinity. Some properties of polynomial B-splines generalize to these rational B-splines: partition of unity, a knot inserting algorithm, numerical stability. It can be proved that the rational B-splines are identical with the Chebyshevian B-splines constructed by T. Lyche. The recursions are not identical and the one for the rational B-splines is more convenient. Furthermore, the rational B-splines are identified as special NURBS. The weights can be chosen depending on the poles.     

以节点与权因子修改为基础的4阶NURBS受限形状控制

改变k阶NURBS曲线的节点,会产生一个单参数NURBS曲线族,该曲线族的包络是用相同控制顶点定义的k-a阶NURBS曲线,这里a是所改变的节点的重数.论文运用这项理论结果,提出了几种建立在修改一个节点与两个连续权因子基础上的4阶NURBS形状控制方法,该方法要受一定的位置与切线方向的约束.     

Degree elevation of nurbs curves by weighted blossom

An algorithmic approach to degree elevation of NURBS curves is presented. The new algorithms are based on the weighted blossoming process and its matrix representation. The elevation method is introduced that consists of the following steps: (a) decompose the NURBS curve into piecewise rational Bézier curves, (b) elevate the degree of each rational Bézier piece, and (c) compose the piecewise rational Bézier curves into NURBS curve.     

DEVELOPABLE SURFACE PATCHES BOUNDED BY NURBS CURVES

In this paper we construct developable surface patches which are bounded by two rational or NURBS curves, though the resulting patch is not a rational or NURBS surface in general. This is accomplished by reparameterizing one of the boundary curves. The reparameterization function is the solution of an algebraic equation. For the relevant case of cubic or cubic spline curves, this equation is quartic at most, quadratic if the curves are Bézier or splines and lie on parallel planes, and hence it may be solved either by standard analytical or numerical methods.     

Bounds on partial derivatives of NURBS surfaces

In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline theory and Dir function, some derivative bounds on NURBS curves are provided. Then, the derivative bounds on the magnitudes of NURBS surfaces are proposed by regarding a rational surface as the locus of a rational curve. Finally, some numerical examples are provided to elucidate how tight the bounds are.     

Relation between algebraic and geometric view on nurbs tensor product surfaces

NURBS (Non-Uniform Rational B-Splines) belong to special approximation curves and surfaces which are described by control points with weights and B-spline basis functions. They are often used in modern areas of computer graphics as free-form modelling, modelling of processes. In literature, NURBS surfaces are often called tensor product surfaces. In this article we try to explain the relationship between the classic algebraic point of view and the practical geometrical application on NURBS.     

NURBS曲面的形状修改的一种方法

NURBS曲面是计算机辅助几何设计和计算机图形中最常用的参数曲面。本文采用NURBS曲面的齐次坐标表示，给出了通过控制顶点和权因子同时改变来修改NURBS曲面形状的一种方法。     

Modeling and homogenization of textile reinforced composites based on the isogeometric analysis

In this contribution, the isogeometric analysis is used to compute the effective material properties of textile reinforced composites. The isogeometric analysis based on non-uniform rational B-splines (NURBS) provides an efficient approach for numerical modeling because there is no need for a mesh generation. There are further advantages such as the availability of a geometry representation based on NURBS in computer-aided design software and the possibility to apply different refinement methods which do not change the geometry of the numerical model. These properties motivate the combination of the isogeometric analysis with the homogenization method. Therefor, the unit cell model representing the inner architecture of a textile reinforced composite is defined using NURBS. In order to compute the effective mechanical properties of the heterogeneous material, the homogenization method with periodic boundary conditions is applied. Finally, two examples demonstrate the advantages of this approach. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR

We consider a subproblem in parameter estimation using the Gauss-Newton algorithm with regularization for NURBS curve fitting. The NURBS curve is fitted to a set of data points in least-squares sense, where the sum of squared orthogonal distances is minimized. Control-points and weights are estimated. The knot-vector and the degree of the NURBS curve are kept constant. In the Gauss-Newton algorithm, a search direction is obtained from a linear overdetermined system with a Jacobian and a residual vector. Because of the properties of our problem, the Jacobian has a particular sparse structure which is suitable for performing a splitting of variables. We are handling the computational problems and report the obtained accuracy using different methods, and the elapsed real computational time. The splitting of variables is a two times faster method than using plain normal equations.     

Shape recovery for sparse‐data tomography

A two‐dimensional sparse‐data tomographic problem is studied. The target is assumed to be a homogeneous object bounded by a smooth curve. A nonuniform rational basis splines (NURBS) curve is used as a computational representation of the boundary. This approach conveniently provides the result in a format readily compatible with computer‐aided design software. However, the linear tomography task becomes a nonlinear inverse problem because of the NURBS‐based parameterization. Therefore, Bayesian inversion with Markov chain Monte Carlo sampling is used for calculating an estimate of the NURBS control points. The reconstruction method is tested with both simulated data and measured X‐ray projection data. The proposed method recovers the shape and the attenuation coefficient significantly better than the baseline algorithm (optimally thresholded total variation regularization), but at the cost of heavier computation.