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

03/14/2020
by   Aleš Vavpetič, et al.
0

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low degree are used and a geometric continuity is prescribed at the boundary points of the circular arc. A general theory about the existence and the uniqueness of the optimal approximant is presented and a rigorous analysis is done for some special cases for which the degree of the polynomial curve and the order of the geometric smoothness differ by two. This includes practically interesting cases of parabolic G^0, cubic G^1, quartic G^2 and quintic G^3 interpolation. Several numerical examples are presented which confirm theoretical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2022

Arc length preserving approximation of circular arcs by Pythagorean-hodograph curves of degree seven

In this paper interpolation of two planar points, corresponding tangent ...
research
11/13/2019

Optimal parametric interpolants of circular arcs

The aim of this paper is a construction of quartic parametric polynomial...
research
12/02/2020

On Planar Polynomial Geometric Interpolation

In the paper, the planar polynomial geometric interpolation of data poin...
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
03/06/2022

Geometric Hermite Interpolation in ℝ^n by Refinements

We describe a general approach for constructing a broad class of operato...
research
02/23/2022

Construction of G^2 planar Hermite interpolants with prescribed arc lengths

In this paper we address the problem of constructing G^2 planar Pythagor...
research
11/04/2012

RE2L: An Efficient Output-sensitive Algorithm for Computing Boolean Operation on Circular-arc Polygons

The boundaries of conic polygons consist of conic segments or second deg...

Please sign up or login with your details

Forgot password? Click here to reset