Pages that link to "Item:Q753381"

The following pages link to Curve intersection using Bézier clipping (Q753381):

Displaying 30 items.

• Conditions for the coincidence of two quartic Bézier curves (Q275838) (← links)
• Bézier representation of the constrained dual Bernstein polynomials (Q427030) (← links)
• Efficient offset trimming for planar rational curves using biarc trees (Q450251) (← links)
• Granular element method for computational particle mechanics (Q503323) (← links)
• Bézier clipping is quadratically convergent (Q625153) (← links)
• Computing intersections of planar spline curves using knot insertion (Q625188) (← links)
• Fast approach for computing roots of polynomials using cubic clipping (Q625270) (← links)
• Conditions for coincidence of two cubic Bézier curves (Q633973) (← links)
• Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578) (← links)
• Computing roots of polynomials by quadratic clipping (Q733402) (← links)
• A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
• Detection of critical points of multivariate piecewise polynomial systems (Q1632388) (← links)
• Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
• A NURBS-based interface-enriched generalized finite element scheme for the thermal analysis and design of microvascular composites (Q1667519) (← links)
• An application of fast factorization algorithms in computer aided geometric design (Q1874663) (← links)
• An improved rational cubic clipping method for computing real roots of a polynomial (Q2008914) (← links)
• A 2-norm condition number for Bézier curve intersection (Q2010366) (← links)
• Simple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomials (Q2017918) (← links)
• Fast and accurate evaluation of dual Bernstein polynomials (Q2035506) (← links)
• Some new symmetric equilateral embeddings of Platonic and Archimedean polyhedra (Q2333758) (← links)
• Differential-recurrence properties of dual Bernstein polynomials (Q2335780) (← links)
• Extending the usage of Newton's method with applications to the solution of Bratu's equation (Q2337234) (← links)
• Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space (Q2337268) (← links)
• A line/trimmed NURBS surface intersection algorithm using matrix representations (Q2357617) (← links)
• Target curvature driven fairing algorithm for planar cubic B-spline curves (Q2388574) (← links)
• Polynomials root-finding using a SLEFE-based clipping method (Q2397808) (← links)
• Improved subdivision scheme for the root computation of univariate polynomial equations (Q2451335) (← links)
• RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS (Q3070041) (← links)
• HIGH-ORDER BISECTION METHOD FOR COMPUTING INVARIANT MANIFOLDS OF TWO-DIMENSIONAL MAPS (Q3165817) (← links)
• A particle localization algorithm on unstructured curvilinear polynomial meshes (Q6101940) (← links)