Polynomial parametrization of curves without affine singularities

J Gutierrez
2002 Computer Aided Geometric Design  
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.
doi:10.1016/s0167-8396(02)00090-0 fatcat:xicpfzytbzaubg34fts4fub3km