Bézier clipping is quadratically convergent

DOI10.1016/j.cagd.2007.12.006zbMath1205.65106OpenAlexW2047632750MaRDI QIDQ625153

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

zbMATH Keywords

quadratic convergenceBézier curvesBézier clippingcurve intersection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (9)

Conditions for the coincidence of two quartic Bézier curves ⋮ A rational cubic clipping method for computing real roots of a polynomial ⋮ Revisiting the problem of zeros of univariate scalar Béziers ⋮ A Framework for Structured Linearizations of Matrix Polynomials in Various Bases ⋮ Computing intersections of planar spline curves using knot insertion ⋮ Conditions for coincidence of two cubic Bézier curves ⋮ A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve ⋮ Granular element method for computational particle mechanics ⋮ A 2-norm condition number for Bézier curve intersection

Cites Work

• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Convergence of subdivision and degree elevation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bézier clipping is quadratically convergent