Abstract
A user-friendly “ divide-and-conquer” algorithm is presented for finding all the self-intersection points of a parametric curve in the Bernstein-Bézier representation. The underlying idea of the algorithm is to deal with the Bézier polygon instead of the curve description itself. By alternately subdividing the Bézier polygon and estimating the self-intersection regions the self-intersection points are finally approximated by straight line intersections of the refined Bézier polygons. The algorithm also calculates the parameter values of the self-intersection points. In addition to the convex hull and the approximation property of the Bézier polygon the working of the algorithm is based on a very intuitive angle criterion.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
