An application of fast factorization algorithms in computer aided geometric design

DOI10.1016/S0024-3795(02)00469-XMaRDI QIDQ1874663zbMATH OpenFDO

Authors F. Fabbri, Giulio Casciola, Laura B. Montefusco

Publication date 25 May 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(02)00469-X

zbMATH Keywords

Bézout resultantcomparisonscomputer aided geometric designcurve intersectionfast algorithmsnumerical examplesstructured matricessymbolic computationtriangular factorization

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Direct numerical methods for linear systems and matrix inversion (65F05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
• An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
• scientific article; zbMATH DE number 493126
• Computing curve intersection by means of simultaneous iterations
• Structured matrices in the application of bivariate interpolation to curve implicitization

Cites work

• Algebraic methods for Toeplitz-like matrices and operators
• Algorithms for polynomials in Bernstein form
• Curve intersection using Bézier clipping
• Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
• Generalized Bezoutians and families of efficient zero-location procedures
• scientific article; zbMATH DE number 491264 (Why is no real title available?)
• Implicitization, inversion, and intersection of planar rational cubic curves
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves

Cited in

(3)

• A hybrid method for computing the intersection and tangency points of plane curves
• Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
• Computing curve intersection by means of simultaneous iterations

This page was built for publication: An application of fast factorization algorithms in computer aided geometric design

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