Related papers: Optimal parametric interpolants of circular arcs
We introduce remarkable upper bounds for the interpolation error constants on triangles, which are sharp and given by simple formulas. These constants are crucial in analyzing interpolation errors, particularly those associated with the…
A new error bound which is better than the current exponential-type error bound is presented in this paper.
We present the error analysis of Lagrange interpolation on triangles. A new \textit{a priori} error estimate is derived in which the bound is expressed in terms of the diameter and circumradius of a triangle. No geometric conditions on…
We study the constructions of piecewise rational interpolation kernels that are supported on the interval $[-2,2]$, and present one novel rational cubic/linear and five quartic/linear interpolation kernels. All proposed kernels are…
We study $W^{1,p}$ Lagrange interpolation error estimates for general quadrilateral $\mathcal{Q}_{k}$ finite elements with $k\ge 2$. For the most standard case of $p=2$ it turns out that the constant $C$ involved in the error estimate can…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
Multi-sided surfaces are often defined by side interpolants (also called ribbons), i.e. the surface has to connect to the ribbons with a prescribed degree of smoothness. The I-patch is such a family of implicit surfaces capable of…
We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic…
In this paper a fourth order asymptotically optimal error bound for a new cubic interpolating spline function, denoted by Q-spline, is derived for the case that only function values at given points are used but not any derivative…
We develop a local polynomial spline interpolation scheme for arbitrary spline order on bounded intervals. Our method's local formulation, effective boundary considerations and optimal interpolation error rate make it particularly useful…
This paper investigates the optimal transport problem within the framework of Linear Quadratic optimal control systems. We establish the well-posedness of the Monge problem and analyze the regularity of the resulting optimal transport map,…
Let p be a puncture of a punctured sphere, and let Q be the set of all other punctures. We prove that the maximal cardinality of a set of arcs pairwise intersecting at most once, which start at p and end in Q, is |X|(|X| + 1). We deduce…
The paper is devoted to the construction of an optimal interpolation formula in $K_2(P_2)$ Hilbert space. Here the interpolation formula consists of a linear combination $\sum_{\beta=0}^NC_{\beta}(z)\varphi(x_\beta)$ of given values of a…
In this paper we address the problem of constructing $G^2$ planar Pythagorean--hodograph (PH) spline curves, that interpolate points, tangent directions and curvatures, and have prescribed arc-length. The interpolation scheme is completely…
We propose a general theory of estimating interpolation error for smooth functions in two and three dimensions. In our theory, the error of interpolation is bound in terms of the diameter of a simplex and a geometric parameter. In the…
Using a residuum approach, we provide a complete description of the space of the rational spatial curves of given tangent directions. The rational Pythagorean hodograph curves are obtained as a special case when the norm of the direction…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
The main result in this paper is an error estimate for interpolation biharmonic polysplines in an annulus $A\left( r_{1},r_{N}\right) $, with respect to a partition by concentric annular domains $A\left( r_{1} ,r_{2}\right) ,$ ....,…
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…
A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…