An algorithm for computing the points at which two planar Bézier curves intersect, and also an algorithm for robustly and quickly computing points of tangency between two curves are developed by a new technique, the so-called Bézier clipping. This strategy uses the convex hull property of Bézier curves to identify regions which do not include a part of the solution. By iteratively clipping away such regions, the solution is obtained by a quadratic convergence rate.
Recommendations
Cited in
(40)- Fat arcs: A bounding region with cubic convergence
- Algorithm for algebraic curve intersection
- A cocktail algorithm for planar Bézier curve intersections.
- 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
- A NURBS-based interface-enriched generalized finite element scheme for the thermal analysis and design of microvascular composites
- An application of fast factorization algorithms in computer aided geometric design
- Homogeneous bounding boxes as tools for intersection algorithms of rational Bézier curves and surfaces
- 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
- 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
- A line/trimmed NURBS surface intersection algorithm using matrix representations
- Target curvature driven fairing algorithm for planar cubic B-spline curves
- Polynomials root-finding using a SLEFE-based clipping method
- Improved subdivision scheme for the root computation of univariate polynomial equations
- Conditions for the coincidence of two quartic Bézier curves
- Reconciling conflicting combinatorial preprocessors for geometric constraint systems
- High-order bisection method for computing invariant manifolds of two-dimensional maps
- Bézier representation of the constrained dual Bernstein polynomials
- Efficient offset trimming for planar rational curves using biarc trees
- scientific article; zbMATH DE number 1555405 (Why is no real title available?)
- Granular element method for computational particle mechanics
- The computation of multiple roots of a Bernstein basis polynomial
- 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
- Conditions for coincidence of two cubic Bézier curves
- Rational cubic clipping with linear complexity for computing roots of polynomials
- Progressive explicit formulae for root-finding problems based on reparameterization
- Projection-driven grid-BSP tree for real-time trimming on GPU
- High-order solution transfer between curved triangular meshes
- A reliable method for finding intersections of 2D NURBS curves
- Computing roots of polynomials by quadratic clipping
This page was built for publication: Curve intersection using Bézier clipping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753381)
