Sciweavers

CAGD
2002

Polynomial parametrization of curves without affine singularities

13 years 4 months ago
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(n3 logn) field operations, where n is the degree of the curve. 2002 Elsevier Science B.V. All rights reserved.
Jaime Gutierrez, Rosario Rubio, Josef Schicho
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2002
Where CAGD
Authors Jaime Gutierrez, Rosario Rubio, Josef Schicho
Comments (0)