Curve intersection using Bézier clipping (Q753381)

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.