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.

In this paper, compositions of a natural number are studied. The number of restricted compositions is given in a closed form, and some applications are presented.

No abstract

We propose a general framework for geometric approximation of circular arcs by parametric polynomial curves. The approach is based on constrained uniform approximation of an error function by scalar polynomials. The system of nonlinear equations for the unknown control points of the approximating polynomial given in the Bézier form is derived and a detailed analysis provided for some low degree cases which might be important in practice. At least for these cases the solutions can be, in principal, written in a closed form, and provide the best known approximants according to the radial distance. A general conjecture on the optimality of the solution is stated and several numerical examples conforming theoretical results are given.

In this paper, geometric interpolation of certain circle-like curves by parametric polynomial curves is studied. It is shown that such an interpolating curve of degree n achieves the optimal approximation order 2 n, the fact already known for particular small values of n. Furthermore, numerical experiments suggest that the error decreases exponentially with growing n.

In this paper, three-pencil lattices on triangulations are studied. The explicit representation of a lattice, based upon barycentric coordinates, enables us to construct lattice points in a simple and numerically stable way. Further, this representation carries over to triangulations in a natural way. The construction is based upon group action of S 3 on triangle vertices, and it is shown that the number of degrees of freedom is equal to the number of vertices of the triangulation.

No abstract

No abstract