Calculating the self-intersections of Bezier curves
MetadataShow full item record
A user-friendly divide-and-conquer algorithm is presented for finding all the self intersection points of a parametric curve in the Bernstein-Bezier representation. The underlying idea of the algorithm is to deal with the Bexier polygon instead of the curve description itself. By alternately subdividing the Bezier polygon and estimating the self intersection regions the self intersection points are finally approximated by straight line intersections of the refined Bezier 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 Bezier polygon the working of the algorithm is based on a very intuitive angle criterion. Keywords: Bezier curves; Spline curves; Intersection
NPS Report NumberNPS-53-88-001
Showing items related by title, author, creator and subject.
Lane, Edward J. (Monterey, California. Naval Postgraduate School, 1995-03);A method is described for least squares filling an ordered set of data in the plane with a free-form curve with no specific function or parameterization given for the data. The method is shown to be effective and uses some ...
A multidisciplinary algorithm for the 3-D design optimization of transonic axial compressor blades Jones, James A. (Monterey, California: Naval Postgraduate School, 2002-06);A new, multidisciplinary algorithm for the CFD design optimization of turbomachinery blades is presented. It departs from existing techniques in that it uses a simple, previously-developed Bezier geometry representation ...
Incorporation of sweep in a transonic fan design using a 3D blade-row geometry package intended for aero-structural-manufacturing optimization Abdelhamid, Hazen Fahmy (Monterey, California. Naval Postgraduate School, 1997);A new 3D blade row geometry package was developed and implemented. In the new representation the blade is described by six Bezier surfaces two of which represent the pressure and suction surfaces with sixteen points each. ...