Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
type: Item
instance of: scholarly article
title: Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
zbMATH Open document ID: 0878.41006
DOI: 10.1016/S0898-1221(97)00020-5
author: O. Diekmann
publication date: 1997-12-15T00:00:00Z
review text: In this paper the one-degree reduction problem with endpoint interpolation in the \(L^1\)-norm is considered. The best one-degree reduction of Bezier curve of the degree \(n \leq 5\) with endpoint interpolation by using the perfect splines is obtained. For the higher degree, it is practically impossible to get the best one-degree reduction in closed form. For the general degree \(n\), it is proposed a ``good'' one degree reduction by use of an appropriate transform of the Chebychev polynomials \(U_n(x)\) of the second type of degree \(n\). By use of the good one-degree reduction, subdivision algorithm is given to get one-degree reduced Bézier curve within a given tolerance \({\mathcal E}\). Let \(\Pi_n[0,1]\) be the set of polynomials \(f_n\) degree \(n\) such that \(f_n(0)= 0=f_n(1)\). A perfect spline of degree \(n\) with \(r\) knots \(0<u_1< \cdots < u_r <1\) on \([0,1]\) is a function of the form \[ P_n(x) =c\left(x^n+2 \sum^r_{i=1} (-1)^i(x-u_i)^n_+ \right) + \sum^{n-1}_{j=0} a_jx^j, \] where \(c\), \(a_0, \dots, a_{n-1}\) are real constants. We say that \(P_n^{n-2} [0,1]\) is the set of perfect splines of degree \(n\), satisfying \(P^i_n(0) =P^i_n(1)\), \(i=0,1, \dots, n-2\), \(|P^n(x) |=1\) and that it corresponds to \(\Pi_n [0,1]\). The following two results are characteristic for this paper: I. A polynomial \(p_{n-1}\) of degree \(n-1\) is the best \(L^1\)-approximation to a given polynomial \(f_n\) of degree \(n\) with endpoint interpolation, if and only if there exists a perfect spline \(P_n\in P_n^{n-2} [0,1]\), where \(P_n^{n -2} [0,1]\) corresponds to \(\Pi_n [0,1]\) such that \(P_n^{(n)} (x)= \text{sgn} (f_n- p_{n-1})\). II. For a Bézier curve \(f_3\) of degree 3 with \(\Delta^3b_0 \neq 0\), the best one degree reduction \(p_2\) of \(f_3\) is given as \(p_2(t)= \sum^2_{l=0} \overline b_iB^2_i(t)\) where \(\overline b_0= b_0\), \(\overline b_1= -{1\over 4} b_0+ {3\over 4} b_1+ {3\over 4} b_1-{1 \over 4} b_3\), \(\overline b_2 =b_3\). The \(L^1\)-norm e…
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 30E05
Mathematics Subject Classification ID: 65D05
zbMATH DE Number: 1021988
zbMATH Keywords: endpoint interpolation
zbMATH Keywords: Bézier curve
reviewed by: Jan Stankiewicz
MaRDI profile type: Publication
cites work: Degree reduction of Bézier curves
cites work: Q3319163
cites work: Degree reduction of Bézier curves by uniform approximation with endpoint interpolation
cites work: Best \(L_ 1\)-approximation
cites work: A survey of curve and surface methods in CAGD
cites work: Practical L p Polynomial Approximation
cites work: Q4041056
cites work: Best \(L_ 1\)-approximation by polynomials
cites work: Best \(L^ 1\)-approximation by polynomials. II
cites work: Chebyshev economization for parametric surfaces
cites work: Best \(L^1\) approximation by weak Chebyshev systems and the uniqueness of interpolating perfect splines
cites work: Q3885038
full work available at URL: s0898-1221(97)00020-5
OpenAlex ID: W1974157698
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1021988