Computing curve intersection by means of simultaneous iterations
A new algorithm is proposed for computing the intersection of two plane curves given in rational parametric form [the general solution steps are described by \textit{J. Hoschek} and \textit{D. Lasser}, Fundamentals of computer aided geometric design (1993; Zbl 0788.68002)]. This approach avoids symbolic manipulations and is completely numerical. It relies on the Ehrlich-Aberth iteration complemented with some computational tools like the properties of Sylvester and Bézout matrices, a stopping criterion based on the concept of pseudo-zero, an inclusion result and the choice of initial approximations based on the Newton polygon. The algorithm is implemented as a Fortran 95 module. From the numerical experiments performed with a wide set of test problems it shows a better robustness and stability with respect to the Manocha-Demmel approach based on eigenvalue computation. In fact, the algorithm provides better approximations in terms of the relative error and performs successfully in many critical cases where the eigenvalue computation fails.
- Computing curve intersection by homotopy methods
- scientific article; zbMATH DE number 6836855
- A unified algorithm for finding the intersection curve of surfaces
- Intersection points of planar curves can be computed
- Algorithm for algebraic curve intersection
- Computing the convex hull of line intersections
- Computer Algebra in Scientific Computing
- Computing intersections between non-compatible curves and finite elements
- Accuracy and Stability of Numerical Algorithms
- Algorithms for intersecting parametric and algebraic curves I
- An application of fast factorization algorithms in computer aided geometric design
- Bernstein-Bézoutian matrices
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Fast computation of determinants of Bézout matrices and application to curve implicitization
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- Improperly parametrized rational curves
- Initial approximations in Durand-Kerner's root finding method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Numerical computation of polynomial zeros by means of Aberth's method
- Root Neighborhoods of a Polynomial
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Using polynomial interpolation for implicitizing algebraic curves
- Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
- A cocktail algorithm for planar Bézier curve intersections.
- An algorithm for curve identification in the presence of curve intersections
- The Sylvester and Bézout resultant matrices for blind image deconvolution
- An application of fast factorization algorithms in computer aided geometric design
- A hybrid method for computing the intersection and tangency points of plane curves
- na25
- Reduced difference polynomials and self-intersection computations
- Computing the common zeros of two bivariate functions via Bézout resultants
- Numerical instability of resultant methods for multidimensional rootfinding
- Intersections of rational parametrized plane curves
- scientific article; zbMATH DE number 6836855 (Why is no real title available?)
- Intersection Queries in Curved Objects
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Computing the signed distance between overlapping ellipsoids
- Algorithms for intersecting parametric and algebraic curves I
- Computer graphics techniques in military applications
- On estimating the common point of intersection of curves.
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Computing intersections of planar spline curves using knot insertion
- A non-iterative method for robustly computing the intersections between a line and a curve or surface
- Computing curve intersection by homotopy methods
This page was built for publication: Computing curve intersection by means of simultaneous iterations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861738)
