On Planar Polynomial Geometric Interpolation

12/02/2020
by   Jernej Kozak, et al.
0

In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a certain discrete sense. This way the Höllig-Koch conjecture on the existence and the approximation order is confirmed in the planar case for parametric polynomial curves of any degree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2020

On optimal polynomial geometric interpolation of circular arcs according to the Hausdorff distance

The problem of the optimal approximation of circular arcs by parametric ...
research
05/18/2020

An error reduced and uniform parameter approximation in fitting of B-spline curves to data points

Approximating data points in three or higher dimension space based on cu...
research
11/13/2018

Parametric Shortest Paths in Planar Graphs

We construct a family of planar graphs (G_n: n≥ 1), where G_n has n vert...
research
02/23/2023

Adaptive Approximate Implicitization of Planar Parametric Curves via Weak Gradient Constraints

Converting a parametric curve into the implicit form, which is called im...
research
12/11/2022

Isometrically deformable cones and cylinders carrying planar curves

We study cones and cylinders with a 1-parametric isometric deformation c...
research
05/15/2020

Spectral mesh-free quadrature for planar regions bounded by rational parametric curves

This work presents spectral, mesh-free, Green's theorem-based numerical ...
research
07/01/2023

On the notion of polynomial reach: a statistical application

The volume function V(t) of a compact set S∈R^d is just the Lebesgue mea...

Please sign up or login with your details

Forgot password? Click here to reset