Curve intersection using Bézier clipping

From MaRDI portal
Publication:753381

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




Related Items (31)

A line/trimmed NURBS surface intersection algorithm using matrix representationsAn application of fast factorization algorithms in computer aided geometric designConditions for the coincidence of two quartic Bézier curvesHIGH-ORDER BISECTION METHOD FOR COMPUTING INVARIANT MANIFOLDS OF TWO-DIMENSIONAL MAPSA rational cubic clipping method for computing real roots of a polynomialDetection of critical points of multivariate piecewise polynomial systemsRevisiting the problem of zeros of univariate scalar BéziersTarget curvature driven fairing algorithm for planar cubic B-spline curvesPolynomials root-finding using a SLEFE-based clipping methodA NURBS-based interface-enriched generalized finite element scheme for the thermal analysis and design of microvascular compositesA particle localization algorithm on unstructured curvilinear polynomial meshesBézier clipping is quadratically convergentComputing intersections of planar spline curves using knot insertionFast approach for computing roots of polynomials using cubic clippingBézier representation of the constrained dual Bernstein polynomialsConditions for coincidence of two cubic Bézier curvesEfficient offset trimming for planar rational curves using biarc treesImproved subdivision scheme for the root computation of univariate polynomial equationsRational cubic clipping with linear complexity for computing roots of polynomialsGranular element method for computational particle mechanicsAn improved rational cubic clipping method for computing real roots of a polynomialA 2-norm condition number for Bézier curve intersectionSimple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomialsFast and accurate evaluation of dual Bernstein polynomialsComputing roots of polynomials by quadratic clippingRECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMSThe Computation of Multiple Roots of a Bernstein Basis PolynomialSome new symmetric equilateral embeddings of Platonic and Archimedean polyhedraDifferential-recurrence properties of dual Bernstein polynomialsExtending the usage of Newton's method with applications to the solution of Bratu's equationHybrid 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