Computing curve intersection by means of simultaneous iterations
Authors:
- 23 November 2006
- journal article
- Published by Springer Nature in Numerical Algorithms
- Vol. 43 (2) , 151-175
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Bernstein–Bezoutian matricesTheoretical Computer Science, 2004
- Using polynomial interpolation for implicitizing algebraic curvesComputer Aided Geometric Design, 2001
- Fast Gaussian elimination with partial pivoting for matrices with displacement structureMathematics of Computation, 1995
- Algorithms for Intersecting Parametric and Algebraic Curves II: Multiple IntersectionsGraphical Models and Image Processing, 1995
- Algorithms for intersecting parametric and algebraic curves IACM Transactions on Graphics, 1994
- Initial approximations in Durand-Kerner's root finding methodBIT Numerical Mathematics, 1986
- Improperly parametrized rational curvesComputer Aided Geometric Design, 1986
- Root neighborhoods of a polynomialMathematics of Computation, 1986
- Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curvesComputer Aided Geometric Design, 1984
- Iteration methods for finding all zeros of a polynomial simultaneouslyMathematics of Computation, 1973