Recognizing and parametrizing curves isomorphic to a line (Q2470058)

In [J. Algebra 197, No. 2, 546--558 (1997; Zbl 0899.13029)], the second and third author described an algorithm to decide whether a given polynomial \(p(x,y)\in K[x,y]\) where \(K\) is a field of characteristic zero is a coordinate. In the article under review the authors calculate the complexity of the above said algorithm. They show that if \(\deg p=n\), then the algorithm requires \(O(n^2)\) operations. They also show that the above algorithm leads to an algorithm to parametrize such a coordinate and it requires \(O(n^2\log n)\) operations. These are better than the corresponding numbers for an algorithm by \textit{J. Gutierrez, R. Rubio} and \textit{J. Schicho} [Comput. Aided Geom. Des. 19, No. 3, 223--234 (2002; Zbl 0995.68154)]. In addition to the importance of recognizing lines in the plane, parametrizing curves apparently play an important role in computer aided designs.