Bézier clipping is quadratically convergent
From MaRDI portal
Publication:625153
DOI10.1016/J.CAGD.2007.12.006zbMATH Open1205.65106OpenAlexW2047632750MaRDI QIDQ625153FDOQ625153
Authors: Christian Schulz
Publication date: 15 February 2011
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2007.12.006
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)
Cites Work
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
- A framework for structured linearizations of matrix polynomials in various bases
- Computing intersections of planar spline curves using knot insertion
- 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)