On parametrization of interpolating curves

In parametric curve interpolation there is given a sequence of data points and corresponding parameter values (nodes), and we want to find a parametric curve that passes through data points at the associated parameter values. We consider those interpolating curves that are described by the combination of control points and blending functions. We study paths of control points and points of the interpolating curve obtained by the alteration of one node. We show geometric properties of quadratic Bézier interpolating curves with uniform and centripetal parameterizations. Finally, we propose geometric methods for the interactive modification and specification of nodes for interpolating Bézier curves.     

A note on the optimal stability of bases of univariate functions

This note is concerned with the characterizations and uniqueness of bases of finite dimensional spaces of univariate continuous functions which are optimally stable for evaluation with respect to bases whose elements have no sign changes.     

C^n-CONTINUOUS B-TYPE SPLINE CURVES WITH ITS LOCALIZATION INTERPOLATION AND APPROXIMATION

This paper presents a class of C ⁿ -continuous B-type spline curves with some parametric factors. The length of their local support is equal to 4. Taking the different values of the parametric factors, the curves can become free-type curves or interpolate a set of given points even mix the both cases. When the parametric factors satisfy the certain conditions, the degrees of the curves can be decreased as low as possible. Besides, when all the parametric factors tend to zero, the curves globally approximate to the control polygon.     

A tension approach to controlling the shape of cubic spline surfaces on FVS triangulations

We propose a parametric tensioned version of the FVS macro-element to control the shape of the composite surface and remove artificial oscillations, bumps and other undesired behaviour. In particular, this approach is applied to C¹ cubic spline surfaces over a four-directional mesh produced by two-stage scattered data fitting methods.     

The shape preserving ang high accuracy approximation with multiquadric

This paper discusses the sufficient conditions for the shape preserving quasi-interpolation with multiquadric. Some quasi-interpolation schema is given such that the interpolation as well as its high derivatives is convergent. Supported by the National Natural Science Foundation of China.     

Optimization of parameters for curve interpolation by cubic splines

In this paper, we present an interpolation method for curves from a data set by means of the optimization of the parameters of a quadratic functional in a space of parametric cubic spline functions. The existence and the uniqueness of this problem are shown. Moreover, a convergence result of the method is established in order to justify the method presented. The aforementioned functional involves some real non-negative parameters; the optimal parametric curve is obtained by the suitable optimization of these parameters. Finally, we analyze some numerical and graphical examples in order to show the efficiency of our method.     

Algorithms for spline wavelet packets on an interval

The aim of this paper is to describe decomposition and reconstruction algorithms for spline wavelet packets on a closed interval. In order to generate packet spaces of dyadic dimensions, it is necessary to modify the approach for spline wavelets on an interval as studied by Chui, Quak and Weyrich in [3, 11]. The first author was supported by the Department of the Air Force, contract F33600-94-M-2603, and the second author by the Department of Defense, contract H98230-R5-93-9187.     

Approximation by interpolating variational splines

In this paper we present an approximation problem of parametric curves and surfaces from a Lagrange or Hermite data set. In particular, we study an interpolation problem by minimizing some functional on a Sobolev space that produces the new notion of interpolating variational spline. We carefully establish a convergence result. Some specific cases illustrate the generality of this work.     

Approximation by smoothing variational vector splines for noisy data

This paper addresses the problem of constructing some free-form curves and surfaces from given to different types of data: exact and noisy data. We extend the theory of D^m${\mathrm{D}}^m$-splines over a bounded domain for noisy data to the smoothing variational vector splines. Both results of convergence for respectively the exact and noisy data are established, as soon as some estimations of errors are given.     

A piecewise approach to piecewise approximation

Tensor-product B-spline surfaces offer a convenient means for representing a set of bivariate data, especially if many surface evaluations are required. This is because the compact support property of the tensor-product spline allows the spline value to be obtained in a time that is (almost) independent of the number of coefficients used to define the surface. The main calculation is the precomputation involved in fitting the data and this can be impractically large if there are many spline coefficients to be calculated. Since the surface produced may be evaluated locally and efficiently, it would be advantageous to exploit local properties in order to fit the data in a piecewise manner. An algorithm to do this is presented.     

Fitting scattered data on spherelike surfaces using tensor products of trigonometric and polynomial splines

Summary A method is presented for fitting a function defined on a general smooth spherelike surfaceS, given measurements on the function at a set of scattered points lying onS. The approximating surface is constructed by mapping the surface onto a rectangle, and using a tensor-product of polynomial splines with periodic trigonometric splines. The use of trigonometric splines allows a convenient solution of the problem of assuring that the resulting surface is continuous and has continuous tangent planes at all points onS. Two alternative algorithms for computing the coefficients of the tensor fit are presented; one based on global least-squares, and the other on the use of local quasi-interpolators. The approximation order of the method is established, and the numerical performance of the two algorithms is compared.Supported in part by the National Science Foundation under Grant DMS-8902331 and by the Alexander von Humboldt Foundation     

Monotonicity preserving representations of non-polynomial surfaces

We prove that, in contrast to the case for rational surfaces, some tensor product representations through spaces containing algebraic, trigonometric and hyperbolic polynomials are monotonicity preserving. The surface representations provided in this paper are the only known monotonicity preserving surfaces in addition to the tensor product Bézier and tensor product B-spline surfaces.     

Constrained approximation by splines with free knots

In this paper, a method that combines shape preservation and least squares approximation by splines with free knots is developed. Besides the coefficients of the spline a subset of the knot sequence, the so-calledfree knots, is included in the optimization process resulting in a nonlinear least squares problem in both the coefficients and the knots. The original problem, a special case of aconstrained semi-linear least squares problem, is reduced to a problem that has only the knots of the spline as variables. The reduced problem is solved by a generalized Gauss-Newton method. Special emphasise is given to the efficient computation of the residual function and its Jacobian. Dedicated to our colleague and teacher Prof. Dr. J. W. Schmidt on the occasion of his 65th birthday Research of the first author was supported by Deutsche Forschungsgemeinschaft under grant Schm 968/2-1,2-2.     

Cubature rule associated with a discrete blending sum of quadratic spline quasi-interpolants

A new cubature rule for a parallelepiped domain is defined by integrating a discrete blending sum of C¹ quadratic spline quasi-interpolants in one and two variables. We give the weights and the nodes of this cubature rule and we study the associated error estimates for smooth functions. We compare our method with cubature rules based on the tensor products of spline quadratures and classical composite Simpson’s rules.     

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.     

Natural bicubic spline fractal interpolation

Fractal Interpolation functions provide natural deterministic approximation of complex phenomena. Cardinal cubic splines are developed through moments (i.e. second derivative of the original function at mesh points). Using tensor product, bicubic spline fractal interpolants are constructed that successfully generalize classical natural bicubic splines. An upper bound of the difference between the natural cubic spline blended fractal interpolant and the original function is deduced. In addition, the convergence of natural bicubic fractal interpolation functions towards the original function providing the data is studied.     

Two shape preserving lagrangeC 2-interpolants

Summary We present a LagrangeC ²-interpolant to scattered convex data which preserves convexity. We also present a LagrangeC ²-interpolant to uniformly spaced monotone data sites which preserves monotonicity. In both cases no further conditions are required on the data values. These interpolants are explicitely described and local. Error isO(h ³) when the function to be interpolated isC ³.     

A shape preserving area true approximation of histogram by rational splines

For a given histogram, we consider an application of a simple rational spline to a shape preserving area true approximation of the histogram. An algorithm for determination of the spline is as easy as one with a quadratic polynomial spline, while the latter does not always preserve the shape of the histogram. Some numerical examples are given at the end of the paper.     

Kernel B-splines on general lattices

The aim of the paper is to provide a computationally effective way to construct stable bases on general non-degenerate lattices. In particular, we define new stable bases on hexagonal lattices and we give some numerical examples which show their usefulness in applications.     

The approximation order of four-point interpolatory curve subdivision

In this paper we derive an approximation property of four-point interpolatory curve subdivision, based on local cubic polynomial fitting. We show that when the scheme is used to generate a limit curve that interpolates given irregularly spaced points, sampled from a curve in any space dimension with a bounded fourth derivative, and the chosen parameterization is chordal, the accuracy is fourth order as the mesh size goes to zero. In contrast, uniform and centripetal parameterizations yield only second order.