Related papers: A general framework for the optimal approximation …
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…
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…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
B\'ezier splines are widely available in various systems with the curves and surface designs. In general, the B\'ezier spline can be specified with the B\'ezier curve segments and a B\'ezier curve segment can be fitted to any number of…
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…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
In this paper, we propose a method to obtain a constrained approximation of a rational B\'{e}zier curve by a polynomial B\'{e}zier curve. This problem is reformulated as an approximation problem between two polynomial B\'{e}zier curves…
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
The aim of this paper is a construction of quartic parametric polynomial interpolants of a circular arc, where two boundary points of a circular arc are interpolated. For every unit circular arc of inner angle not greater than $\pi$ we find…
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…
We present the first formulation of the optimal polynomial approximation of the solution of linear non-autonomous systems of ODEs in the framework of the so-called $\star$-product. This product is the basis of new approaches for the…
We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
In this paper, we propose a linear method for $C^{(r,s)}$ approximation of rational B\'{e}zier curve with arbitrary degree polynomial curve. Based on weighted least-squares, the problem be converted to an approximation between two…
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is…
We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…
Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…