Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
DOI10.1002/NLA.444zbMATH Open1164.65314OpenAlexW2061784327MaRDI QIDQ3599994FDOQ3599994
L. Gemignani, Dario A. Bini, Joab R. Winkler
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
Recommendations
- An application of fast factorization algorithms in computer aided geometric design
- A unified approach to resultant matrices for Bernstein basis polynomials
- Bernstein-Bézoutian matrices
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Computational experiments with resultants for scaled Bernstein polynomials
Gaussian eliminationBernstein polynomialcomputer graphicstriangular factorizationBernstein basisintersection pointscomputer aided geometric design (CAGD)resultant of polynomialsBézier curveBézoutian matrixfast fraction-free algorithm
Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational aspects of algebraic curves (14Q05)
Cites Work
Cited In (10)
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- Linearizations of matrix polynomials in Bernstein bases
- A unified approach to resultant matrices for Bernstein basis polynomials
- Title not available (Why is that?)
- Bernstein Bézoutians and application to intersection problems
- An application of fast factorization algorithms in computer aided geometric design
- The Bernstein polynomial basis: a centennial retrospective
- A Framework for Structured Linearizations of Matrix Polynomials in Various Bases
- Interpolation and convergence of Bernstein-Bézier coefficients
- The Bézout matrix for Hermite interpolants
This page was built for publication: Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599994)