Pages that link to "Item:Q4296531"

The following pages link to Algorithms for intersecting parametric and algebraic curves I (Q4296531):

Displaying 21 items.

• Fiedler companion linearizations for rectangular matrix polynomials (Q426089) (← links)
• Bernstein Bézoutians and application to intersection problems (Q426192) (← links)
• A subdivision method for computing nearest gcd with certification (Q638509) (← links)
• Computing curve intersection by homotopy methods (Q651931) (← links)
• GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems (Q660912) (← links)
• Computing curve intersection by means of simultaneous iterations (Q861738) (← links)
• Intersection points algorithm for piecewise algebraic curves based on Groebner bases (Q1032555) (← links)
• Algebraic pruning: a fast technique for curve and surface intersection (Q1389457) (← links)
• A new approach to the surface intersection problem (Q1391943) (← links)
• Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)
• An algorithm for curve identification in the presence of curve intersections (Q1721348) (← links)
• A companion matrix resultant for Bernstein polynomials (Q1863577) (← links)
• Intersection of a ruled surface with a free-form surface (Q2463437) (← links)
• Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
• Computing the common zeros of two bivariate functions via Bézout resultants (Q2514244) (← links)
• Numerical instability of resultant methods for multidimensional rootfinding (Q2796860) (← links)
• Localization theorems for nonlinear eigenvalue problems (Q2808263) (← links)
• Interface handling for three-dimensional higher-order XFEM-computations in fluid-structure interaction (Q3399329) (← links)
• (Q4590676) (← links)
• Accurate solution of polynomial equations using Macaulay resultant matrices (Q4821046) (← links)
• Polynomial Roots from Companion Matrix Eigenvalues (Q4846018) (← links)