Pages that link to "Item:Q861738"
From MaRDI portal
The following pages link to Computing curve intersection by means of simultaneous iterations (Q861738):
Displaying 17 items.
- na25 (Q23434) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
- Computing intersections of planar spline curves using knot insertion (Q625188) (← links)
- Computing curve intersection by homotopy methods (Q651931) (← links)
- A cocktail algorithm for planar Bézier curve intersections. (Q1401864) (← links)
- An algorithm for curve identification in the presence of curve intersections (Q1721348) (← links)
- The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
- An application of fast factorization algorithms in computer aided geometric design (Q1874663) (← links)
- A hybrid method for computing the intersection and tangency points of plane curves (Q2250221) (← links)
- Reduced difference polynomials and self-intersection computations (Q2423149) (← 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)
- (Q3134267) (← links)
- Intersection Queries in Curved Objects (Q3141532) (← links)
- Computing the Signed Distance Between Overlapping Ellipsoids (Q3454510) (← links)
- Algorithms for intersecting parametric and algebraic curves I (Q4296531) (← links)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
