Polynomial parametrization of curves without affine singularities
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n(3) log n) field operations, where n is the degree of the curve. (C) 2002 Elsevier Science B.V. All rights reserved.
parametric curves symbolic computation algebraic geometry