Regular curves and proper parametrizations

  • Authors:
  • D. Manocha

  • Affiliations:
  • Computer Science Division, University of California, Berkeley, California

  • Venue:
  • ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an algorithm for determining whether a given rational parametric curve, defined as vector valued function over a finite domain, has a regular parametrization. A curve has a regular parametrization if it has no cusps in its defining interval. It has been known that the vanishing of the derivative vector is a necessary condition for the existence of cusps. We show that if a curve is properly parametrized, then the vanishing of the derivative vector is a necessary and sufficient condition for the existence of cusps. If a curve has no cusps in its defining interval, its proper parametrization is a regular parametrization. We present a simple algorithm to compute the proper parametrization of a polynomial parametric curve which is used to analyze for cusps and later on reduce the problem of detecting cusps in a rational curve to that of a polynomial curve.