In [4] the first named author discussed the explicit solutions of the cubic spline interpolation problems. We are now concerned with quintic spline functions. Let 5B[0, n] denote the class of quintic spline functions S(x) defined in the interval [0, n] and having the points 0, 1, • • • , n — 1 as knots. This means that the restriction of S(x) to the interval (*>, J > + 1 ) (P = 0, • • • , n — \...

abstract Evaluating and comparing the quality of surface interpolants is an important problem in computer graphics, computer aided geometric design and scientiic visualization. We introduce geometric uncertainty as a measure of interpolation error, level of conndence or quality of an interpolant. Geometric uncertainty can be estimated as a scalar or a vector-valued function that depends upon ge...

Consider a family of functions of a single variable x: Φ(x; a0, a1, . . . , an), where a0, . . . , an are the parameters. The problem of interpolation for Φ can be stated as follows: Given n + 1 real or complex pairs of numbers (xi, fi), i = 0, . . . , n, with xi 6= xk for i 6= k, determine a0, . . . , an such that Φ(xi; a0, . . . , an) = fi, i = 0, . . . , n. The above is a linear interpolatio...

A block-centered, finite difference model of two-dimensional groundwater flow yields velocity values at the midpoints of interfaces between adjacent blocks. Method of characteristics, random walk and particle-tracking models of solute transport equire velocities at arbitrary particle locations within the finite difference grid. Particle path lines and travel times are sensitive to the spatial i...

The problem of semi-cardinal spline interpolation was solved by Schoenberg exploiting the piecewise polynomial form of the splines. In the present paper, we propose a new construction for the Lagrange functions of semi-cardinal spline interpolation , based on a radial basis and Fourier transform approach. This approach suggests a way of extending semi-cardinal interpolation to polyharmonic spli...

This paper presents the nearest neighbor value (NNV) algorithm for high resolution (H.R.) image interpolation. The difference between the proposed algorithm and conventional nearest neighbor algorithm is that the concept applied, to estimate the missing pixel value, is guided by the nearest value rather than the distance. In other words, the proposed concept selects one pixel, among four direct...

This is an intuitive description of some of the parametric spline formulations that are most prevalent in computer graphics. The intent is to provide a "high-level". descriptive presentation rather than a detailed, rigorous one. The specific teChniques discussed are piecewise Hermite interpolation. spline interpolation. B6zier curves. Bsplines. Beta-splines. and rational splines. The topics of ...

In this paper we present a new method for the model of interpolation sweep surfaces by the C-continuous generalized quasicubic interpolation spline. Once given some key position, orientation and some points which are passed through by the spine and initial cross-section curves, the corresponding sweep surface can be constructed by the introduced spline function without calculating control point...

We generate a basis of the space of bicubic and biquartic C-smooth geometrically continuous isogeometric functions on bilinear multi-patch domains Ω ⊂ R. The basis functions are obtained by suitably combining C-smooth geometrically continuous isogeometric functions on bilinearly parameterized two-patch domains (cf. [16]). They are described by simple explicit formulas for their spline coefficie...