Computing curve intersection by means of simultaneous iterations
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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 Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast computation of determinants of Bézout matrices and application to curve implicitization
- 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
Cited in
(21)- A hybrid method for computing the intersection and tangency points of plane curves
- Algorithms for intersecting parametric and algebraic curves I
- A non-iterative method for robustly computing the intersections between a line and a curve or surface
- A cocktail algorithm for planar Bézier curve intersections.
- Computing the signed distance between overlapping ellipsoids
- Computing the common zeros of two bivariate functions via Bézout resultants
- Computing intersections of planar spline curves using knot insertion
- Intersection Queries in Curved Objects
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Numerical instability of resultant methods for multidimensional rootfinding
- na25
- The Sylvester and Bézout resultant matrices for blind image deconvolution
- An application of fast factorization algorithms in computer aided geometric design
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Computer graphics techniques in military applications
- Computing curve intersection by homotopy methods
- scientific article; zbMATH DE number 6836855 (Why is no real title available?)
- On estimating the common point of intersection of curves.
- Reduced difference polynomials and self-intersection computations
- Intersections of rational parametrized plane curves
- An algorithm for curve identification in the presence of curve intersections
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)
