An application of fast factorization algorithms in computer aided geometric design
From MaRDI portal
Publication:1874663
DOI10.1016/S0024-3795(02)00469-XzbMath1018.65021MaRDI QIDQ1874663
F. Fabbri, Giulio Casciola, L. Bacchelli Montefusco
Publication date: 25 May 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
numerical examplessymbolic computationfast algorithmscomparisonscomputer aided geometric designstructured matricestriangular factorizationcurve intersectionBézout resultant
Symbolic computation and algebraic computation (68W30) Computer-aided design (modeling of curves and surfaces) (65D17) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Computing curve intersection by means of simultaneous iterations ⋮ A hybrid method for computing the intersection and tangency points of plane curves
Cites Work
- Unnamed Item
- Curve intersection using Bézier clipping
- Algebraic methods for Toeplitz-like matrices and operators
- Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
- Algorithms for polynomials in Bernstein form
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Generalized Bezoutians and families of efficient zero-location procedures
- Implicitization, inversion, and intersection of planar rational cubic curves
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
