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.
Crane, Jerry Allen (Monterey, California. Naval Postgraduate School, 1991-09);This thesis describes a method for computing globally shortest paths for a point robot in a two-dimensional, orthogonal world composed of convex and concave polygons through the construction of obstacle common tangent ...
New motion planning and real-time localization methods using proximity for autonomous mobile robots Wahdan, Mahmoud A. (Monterey, California. Naval Postgraduate School, 1996-09);One of the most difficult theoretical problems in robotics--motion planning for rigid body robots-- must be solved before a robot can perform real- world tasks such as mine searching and processing. This dissertation ...
McGhee, Robert B.; Zyda, Michael J.; Potts, Jeffrey Hal (Monterey, California. Naval Postgraduate School, 1987-02); NPS52-87-044This study presents a three step algorithm for the decomposition of arbitrary, three dimensional, planar polygons into convex polygons. Through a series of translations and rotations, an arbitrary polygon is mapped onto ...