Best linear common divisors for approximate degree reduction

DOI10.1016/0010-4485(93)90041-LMaRDI QIDQ1803693zbMATH OpenOpenAlexFDO

Authors T. W. Sederberg, Geng-zhe Chang

Publication date 29 June 1993

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0010-4485(93)90041-l

zbMATH Keywords

best linear common divisorsdegree reductionminimum normnearest common divisorrational curve

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Computer-aided design (modeling of curves and surfaces) (65D17)

Review text

Let \(f_ 1,\dots,f_ m\) be a set of polynomials of highest degree \(n\). One can search for perturbation polynomials \(\varepsilon_ j\) of degree \(\leq n\) such that \(f_ 1 + \varepsilon_ 1,\dots,f_ m + \varepsilon_ m\) have a common zero. The size of the \(m\)-vector \(\vec\varepsilon(t)\) with components \(\varepsilon_ j(t)\) is measured by the norm \(\| \vec\varepsilon\| := \max\{|\vec\varepsilon(t)|, t \in [a,b]\}\), where \(|\vec\varepsilon(t)|\) is the Euclidean norm and \([a,b]\) is a fixed interval. It is shown that this problem with the side condition that the size \(\| \vec\varepsilon\|\) of the perturbation be minimal can be solved analytically. This is applied to the problem of approximately reducing the degree of a rational curve.

Recommendations

• Approximate common divisors of polynomials and degree reduction for rational curves
• Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
• Perturbing Béziercoefficients for best constrained degree reduction in the L2-norm
• scientific article; zbMATH DE number 1210202
• Degree reduction of Bézier curves

Cited in

(7)

• Approximate common divisors of polynomials and degree reduction for rational curves
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• A companion matrix resultant for Bernstein polynomials
• Degree reduction of rational Bézier curves by hybrid optimization method
• Constrained multi-degree reduction of rational Bézier curves using reparameterization
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

This page was built for publication: Best linear common divisors for approximate degree reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803693)