Computing with barycentric polynomials

DOI10.1007/BF03028345zbMath0746.65011MaRDI QIDQ1181866

Rida T. Farouki

Publication date: 27 June 1992

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

zbMATH Keywords

stabilitycomputer-aided geometric designcomputer algebraBézier curvesBernstein basis functionsSubdivisionCondition numberspolynomials under the barycentric form

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Approximating \(x^ n\) efficiently ⋮ Recursive de Casteljau bisection and rounding errors ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ A novel generalization of Bézier curve and surface ⋮ Generalized Bernstein polynomials and Bézier curves: an application of umbral calculus to computer aided geometric design ⋮ On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On condition numbers and the distance to the nearest ill-posed problem
• On the numerical condition of polynomials in Bernstein form
• Algorithms for polynomials in Bernstein form
• Bounds on a polynomial
• On the condition of algebraic equations
• On the stability of transformations between power and Bernstein polynomial forms
• On the conditioning of polynomial and rational forms
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• Root Neighborhoods of a Polynomial
• Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces
• On the Numerical Condition of Bernstein-Bezier Subdivision Processes
• A Theory of Condition
• Interactive Interpolation and Approximation by Bezier Polynomials