Related papers: Fast and accurate $G^1$ fitting of clothoid curves
An effective solution to the problem of Hermite $G^1$ interpolation with a clothoid curve is provided. At the beginning the problem is naturally formulated as a system of nonlinear equations with multiple solutions that is generally…
In the field of aesthetic design, log-aesthetic curves have a significant role to meet the high industrial requirements. In this paper, we propose a new interactive $G^1$ Hermite interpolation method based on the algorithm of Yoshida et al.…
Interpolation of data on non-Euclidean spaces is an active research area fostered by its numerous applications. This work considers the Hermite interpolation problem: finding a sufficiently smooth manifold curve that interpolates a…
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
We describe a general approach for constructing a broad class of operators approximating high-dimensional curves based on geometric Hermite data. The geometric Hermite data consists of point samples and their associated tangent vectors of…
This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances of the standard multipoint interpolation and evaluation…
The method of constructing trigonometric Hermite splines, which interpolate the values of some periodic function and its derivatives in the nodes of a uniform grid, is considered. The proposed method is based on the periodicity properties…
This paper outlines a methodology for constructing a geometrically smooth interpolatory curve in $\mathbb{R}^d$ applicable to oriented and flattenable points with $d\ge 2$. The construction involves four essential components: local…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
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 study monotone Hermite interpolation on an interval, where both function values and first derivatives are prescribed at the nodes. Among all $C^{1,1}$ interpolants, we seek one with optimal curvature, measured by $\|F''\|_{L^\infty}$. In…
We consider geometric Hermite subdivision for planar curves, i.e., iteratively refining an input polygon with additional tangent or normal vector information sitting in the vertices. The building block for the (nonlinear) subdivision…
Singular and oscillatory functions feature in numerous applications. The high-accuracy approximation of such functions shall greatly help us develop high-order methods for solving applied mathematics problems. This paper demonstrates that…
We formulate a simple algorithm for computing global exact symmetries of closed discrete curves in plane. The method is based on a suitable trigonometric interpolation of vertices of the given polyline and consequent computation of the…
Hermite spectral method plays an important role in the numerical simulation of various partial differential equations (PDEs) on unbounded domains. In this work, we study the superconvergence properties of Hermite spectral interpolation,…
In astrophysical and cosmological analyses, the increasing quality and volume of astronomical data demand efficient and precise computational tools. This work introduces a novel adaptive algorithm for automatic knots (AutoKnots) allocation…
In this paper, we describe an algorithm for fitting an analytic and bandlimited closed or open curve to interpolate an arbitrary collection of points in $\mathbb{R}^{2}$. The main idea is to smooth the parametrization of the curve by…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
A novel static algorithm is proposed for numerical reparametrization of periodic planar curves. The method identifies a monitor function of the arclength variable with the true curvature of an open planar curve and considers a simple…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…