Abstract. In this paper, the geometric interpolation of planar data points and boundary tangent directions by a cubic G 2 Pythagorean-hodograph (PH) spline curve is studied. It is shown that such an interpolant exists under some natural assumptions on the data. The construction of the spline is based upon the solution of a tridiagonal system of nonlinear equations. The asymptotic approximation order 4 is confirmed.

In this paper, we propose a novel method for efficiently calculating the eigenvectors of uniformly rotated images of a set of templates. As we show, the images can be optimally approximated by a linear series of eigenvectors which can be calculated without actually decomposing the sample covariance matrix.

No abstract

Abstract. In this paper the problem of geometric interpolation of planar data by parametric polynomial curves is revisited. The conjecture that a parametric polynomial curve of degree ≤ n can interpolate 2n given points in R 2 is confirmed for n ≤ 5 under certain natural restrictions. This conclusion also implies the optimal asymptotic approximation order. More generally, the optimal order 2n can be achieved as soon as the interpolating curve exists.

In this paper, the geometric Lagrange interpolation of four points by planar cubic Pythagorean-hodograph (PH) curves is studied. It is shown that such an interpolatory curve exists provided that the data polygon, formed by the interpolation points, is convex, and satisfies an additional restriction on its angles. The approximation order is 4. This gives rise to a conjecture that a PH curve of degree n can, under some natural restrictions on data points, interpolate up to n + 1 points.