Curve intersection using Bézier clipping
From MaRDI portal
Publication:753381
DOI10.1016/0010-4485(90)90039-FzbMath0716.65005MaRDI QIDQ753381
Thomas W. Sederberg, Tomoyuki Nishita
Publication date: 1990
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
algorithm; Bézier curves; convex hull property; quadratic convergence rate; Bézier clipping; curve intersection; points of tangency
65D17: Computer-aided design (modeling of curves and surfaces)
Related Items
Bézier clipping is quadratically convergent, Computing intersections of planar spline curves using knot insertion, Fast approach for computing roots of polynomials using cubic clipping, Conditions for coincidence of two cubic Bézier curves, Computing roots of polynomials by quadratic clipping, An application of fast factorization algorithms in computer aided geometric design, Target curvature driven fairing algorithm for planar cubic B-spline curves, RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS