Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis

DOI10.1002/nla.444zbMath1164.65314OpenAlexW2061784327MaRDI QIDQ3599994

Luca Gemignani, Dario Andrea Bini, Winkler, Joab R.

Publication date: 9 February 2009

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.444

zbMATH Keywords

computer graphicsGaussian eliminationBernstein polynomialBézier curveBernstein basistriangular factorizationBézoutian matrixintersection pointscomputer aided geometric design (CAGD)resultant of polynomialsfast fraction-free algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational aspects of algebraic curves (14Q05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Linearizations of matrix polynomials in Bernstein bases, A Framework for Structured Linearizations of Matrix Polynomials in Various Bases, Bernstein Bézoutians and application to intersection problems, The Bernstein polynomial basis: a centennial retrospective, Interpolation and convergence of Bernstein-Bézier coefficients, Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis, A unified approach to resultant matrices for Bernstein basis polynomials, The Bézout matrix for Hermite interpolants

Cites Work

• Unnamed Item
• Unnamed Item