Curve intersection using Bézier clipping

DOI10.1016/0010-4485(90)90039-FzbMath0716.65005OpenAlexW1977248580MaRDI QIDQ753381

Thomas W. Sederberg, Tomoyuki Nishita

Publication date: 1990

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4485(90)90039-f

zbMATH Keywords

algorithmBézier curvesconvex hull propertyquadratic convergence rateBézier clippingcurve intersectionpoints of tangency

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (31)

A line/trimmed NURBS surface intersection algorithm using matrix representations ⋮ An application of fast factorization algorithms in computer aided geometric design ⋮ Conditions for the coincidence of two quartic Bézier curves ⋮ HIGH-ORDER BISECTION METHOD FOR COMPUTING INVARIANT MANIFOLDS OF TWO-DIMENSIONAL MAPS ⋮ A rational cubic clipping method for computing real roots of a polynomial ⋮ Detection of critical points of multivariate piecewise polynomial systems ⋮ Revisiting the problem of zeros of univariate scalar Béziers ⋮ Target curvature driven fairing algorithm for planar cubic B-spline curves ⋮ Polynomials root-finding using a SLEFE-based clipping method ⋮ A NURBS-based interface-enriched generalized finite element scheme for the thermal analysis and design of microvascular composites ⋮ A particle localization algorithm on unstructured curvilinear polynomial meshes ⋮ 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 ⋮ Bézier representation of the constrained dual Bernstein polynomials ⋮ Conditions for coincidence of two cubic Bézier curves ⋮ Efficient offset trimming for planar rational curves using biarc trees ⋮ Improved subdivision scheme for the root computation of univariate polynomial equations ⋮ Rational cubic clipping with linear complexity for computing roots of polynomials ⋮ Granular element method for computational particle mechanics ⋮ An improved rational cubic clipping method for computing real roots of a polynomial ⋮ A 2-norm condition number for Bézier curve intersection ⋮ Simple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomials ⋮ Fast and accurate evaluation of dual Bernstein polynomials ⋮ Computing roots of polynomials by quadratic clipping ⋮ RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Some new symmetric equilateral embeddings of Platonic and Archimedean polyhedra ⋮ Differential-recurrence properties of dual Bernstein polynomials ⋮ Extending the usage of Newton's method with applications to the solution of Bratu's equation ⋮ Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space

This page was built for publication: Curve intersection using Bézier clipping