Related Experiment Video
Updated: Sep 7, 2025

Operation of the Collaborative Composite Manufacturing CCM System
Published on: October 1, 2019
Curve intersection based on cubic hybrid clipping
Yaqiong Wu1, Xin Li2
1School of Mathematical Science, University of Science and Technology of China, Hefei, 200026, Anhui, China.
Abstract:
This study presents a novel approach to computing all intersections between two Bézier curves using cubic hybrid clipping. Each intersection is represented by two strip intervals that contain an intersection. In each step, one curve is bounded by two fat lines, and the other is bounded by two cubic Bézier curves, clipping away the domain that does not contain the intersections. By selecting the moving control points of the cubic hybrid curves, better cubic polynomial bounds are obtained to make the proposed method more efficient. It was proved that the two strip intervals have second- and fourth-order convergence rates for transversal intersections. Experimental results show that the new algorithm is the most efficient among all existing curve/curve intersection approaches.
Related Concept Videos
Horizontal Curve: Problem Solving
Introduction to Horizontal Curves
Elevation of Intermediate Points on Vertical Curves
Sight Distance in a Vertical Curve
Curvilinear Motion: Rectangular Components
As the car advances, its position evolves over time. Quantifying the car's velocity involves computing the...
Vertical Curve: Problem Solving

