Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Detecting Cusps and Inflection Points in Curves

Dinesh Manocha and John F. Canny

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-89-549
January 1990

http://www.eecs.berkeley.edu/Pubs/TechRpts/1989/CSD-89-549.pdf

In many applications it is desirable to analyze parametric curves for undesirable features like cusps and inflection points. Previously known methods to analyze such features are limited to cubics and in many cases are for planar curves only. We present a general purpose method to detect cusps in polynomial or rational space curves of arbitrary degree. If a curve has no cusp in its defining interval, it has a regular parametrization and our algorithm computes that.

In particular, we show that if a curve has a proper parametrization then the necessary and sufficient condition for the existence of cusps is given by the vanishing of the first derivative vector. We present a simple algorithm to compute the proper parametrization of a polynomial curve and reduce the problem of detecting cusps in a rational curve to that of a polynomial curve. Finally, we use the regular parametrizations to analyze for inflection points.


BibTeX citation:

@techreport{Manocha:CSD-89-549,
    Author = {Manocha, Dinesh and Canny, John F.},
    Title = {Detecting Cusps and Inflection Points in Curves},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1990},
    Month = {Jan},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/5907.html},
    Number = {UCB/CSD-89-549},
    Abstract = {In many applications it is desirable to analyze parametric curves for undesirable features like cusps and inflection points. Previously known methods to analyze such features are limited to cubics and in many cases are for planar curves only. We present a general purpose method to detect cusps in polynomial or rational space curves of arbitrary degree. If a curve has no cusp in its defining interval, it has a regular parametrization and our algorithm computes that. <p>In particular, we show that if a curve has a proper parametrization then the necessary and sufficient condition for the existence of cusps is given by the vanishing of the first derivative vector. We present a simple algorithm to compute the proper parametrization of a polynomial curve and reduce the problem of detecting cusps in a rational curve to that of a polynomial curve. Finally, we use the regular parametrizations to analyze for inflection points.}
}

EndNote citation:

%0 Report
%A Manocha, Dinesh
%A Canny, John F.
%T Detecting Cusps and Inflection Points in Curves
%I EECS Department, University of California, Berkeley
%D 1990
%@ UCB/CSD-89-549
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/5907.html
%F Manocha:CSD-89-549