In this paper, geometric Hermite interpolation by planar cubic G1 splines is studied. Three data points and three tangent directions are interpolated per each polynomial segment. Sufficient conditions for the existence of such G1 spline are determined that cover most of the cases encountered in practical applications. The existence requirements are based only upon geometric properties of data a...

Classical Cubic spline interpolation needs to solve a set of equations of high dimension. In this work we show how to compute the interpolant using a FIR digital filter, with a reduced number of operations per interpolated point and high accuracy. Additionally, the computation can be made on real time as the signal samples are acquired. Following this approach, we show how to obtain easily the ...

In this paper, we will apply cubic B-splines on a uniform mesh to explore the numerical solutions and numerical derivatives of a class of nonlinear second-order boundary value problems with two dependent variables. Our new method is based on the cubic spline interpolation. The analytical solutions and any-order derivatives can be well approximated with 4th order accuracy. Furthermore, our new m...

In this paper we present a construction of interpolatory Hermite multiwavelets for functions that take values in nonlinear geometries such as Riemannian manifolds or Lie groups. We rely on the strong connection between wavelets and subdivision schemes to define prediction-correction approach based operate manifold-valued data. The main result concerns decay wavelet coefficients: show our essent...

In the context of radial basis function interpolation, the construction of native spaces and the techniques for proving error bounds deserve some further clari cation and improvement. This can be described by applying the general theory to the special case of cubic splines. It shows the prevailing gaps in the general theory and yields a simple approach to local error bounds for cubic spline int...

A method for computing the numerical solution of Vlasov type equations on massively parallel computers is presented. In contrast with Particle In Cell methods which are known to be noisy, the method is based on a semi-Lagrangian algorithm that approaches the Vlasov equation on a grid of phase space. As this kind of method requires a huge computational effort, the simulations are carried out on ...

This paper proposesa new class of unit quaternion curves in SO(3). A general method is developed that transforms a curve in R3 (defined as a weighted sum of basis functions) into its unit quaternion analogue in SO(3). Applying the method to well-known spline curves (such as Bézier, Hermite, and B-spline curves), we are able to construct various unit quaternion curves which share many important ...

A constructive approach is adopted to build B-spline like basis for cubic spline curves with a more general continuity than beta-continuity. This method provides not only a large variety of very interesting shape controls like biased, point, and interval tensions but, as a special case, also recovers a number of spline methods like nu-spline of Nielson[9], beta-splines[1], gamma-splines of Boeh...

This article presents uniform B-spline interpolation, completely contained on the graphics processing unit (GPU). This implies that the CPU does not need to compute any lookup tables or B-spline basis functions. The cubic interpolation can be decomposed into several linear interpolations [Sigg and Hadwiger 05], which are hard-wired on the GPU and therefore very fast. Here it is demonstrated tha...