Algorithms for intersecting parametric and algebraic curves I
From MaRDI portal
algebraic curveCayley's elimiantion algorithmcurve intersectiondeterminanteliminantmatrix polynomialparametric Bézier curvestable algorithm
Computational aspects of algebraic curves (14Q05) Determinants, permanents, traces, other special matrix functions (15A15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to systems of equations (65H10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- Computing curve intersection by means of simultaneous iterations
- The intersection problems of real parametric curves and surfaces by means of matrix based implicit representations: a new approach
- Algorithm for algebraic curve intersection
- Computer Algebra in Scientific Computing
- Algebraic pruning: a fast technique for curve and surface intersection
Cited in
(23)- Intersection points algorithm for piecewise algebraic curves based on Groebner bases
- Algebraic pruning: a fast technique for curve and surface intersection
- A new approach to the surface intersection problem
- Efficient algorithms for line and curve segment intersection using restricted predicates
- An algorithm for curve identification in the presence of curve intersections
- A companion matrix resultant for Bernstein polynomials
- Intersection of a ruled surface with a free-form surface
- Global minimization of rational functions and the nearest GCDs
- Computing the common zeros of two bivariate functions via Bézout resultants
- Numerical instability of resultant methods for multidimensional rootfinding
- Localization theorems for nonlinear eigenvalue problems
- Interface handling for three-dimensional higher-order XFEM-computations in fluid-structure interaction
- Fiedler companion linearizations for rectangular matrix polynomials
- Bernstein Bézoutians and application to intersection problems
- scientific article; zbMATH DE number 6810149 (Why is no real title available?)
- Accurate solution of polynomial equations using Macaulay resultant matrices
- Polynomial Roots from Companion Matrix Eigenvalues
- A subdivision method for computing nearest gcd with certification
- An Algorithm for the Intersection Problem of Planar Parametric Curves
- Computing curve intersection by homotopy methods
- GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
- Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
- Computing curve intersection by means of simultaneous iterations
This page was built for publication: Algorithms for intersecting parametric and algebraic curves I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296531)
