Recommendations
- Curve intersection using Bézier clipping
- Computing roots of polynomials by quadratic clipping
- Rational cubic clipping with linear complexity for computing roots of polynomials
- Fat arcs: A bounding region with cubic convergence
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
Cites work
- scientific article; zbMATH DE number 3703310 (Why is no real title available?)
- scientific article; zbMATH DE number 1061412 (Why is no real title available?)
- scientific article; zbMATH DE number 1070448 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- Computing roots of polynomials by quadratic clipping
- Convergence of subdivision and degree elevation
- Curve intersection using Bézier clipping
Cited in
(12)- Revisiting the problem of zeros of univariate scalar Béziers
- A rational cubic clipping method for computing real roots of a polynomial
- A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
- Computing intersections of planar spline curves using knot insertion
- A framework for structured linearizations of matrix polynomials in various bases
- Conditions for the coincidence of two quartic Bézier curves
- Conditions for coincidence of two cubic Bézier curves
- Curve intersection using Bézier clipping
- A 2-norm condition number for Bézier curve intersection
- Fat arcs: A bounding region with cubic convergence
- An Algorithm for the Intersection Problem of Planar Parametric Curves
- Granular element method for computational particle mechanics
This page was built for publication: Bézier clipping is quadratically convergent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625153)
