Polynomial parametrization of curves without affine singularities

Authors:
J. Gutierrez;R. Rubio;J. Schicho
Affiliations:
Dep. de Matemáticas Estadística y Computación, Universidad de Cantabria, E-39071 Santander, Spain;Dep. de Matemáticas Estadística y Computación, Universidad de Cantabria, E-39071 Santander, Spain;RISC, Johannes Kepler University, A-4040 Linz, Austria
Venue:
Computer Aided Geometric Design
Year:
2002

Citing 10
Cited 1

Automatic parameterization of rational curves and surfaces III: algebraic plane curves

Computer Aided Geometric Design
Implicitization of rational parametric equations

Journal of Symbolic Computation
On the choice of pencils in the parametrization of curves

Journal of Symbolic Computation
Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
An implicitization algorithm with fewer variables

Computer Aided Geometric Design
Implicitization of parametric curves and surfaces by using symmetric functions

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Parametrization of algebraic curves over optimal field extensions

Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
Rational parametrizations of algebraic curves using a canonical divisor

Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
The moving line ideal basis of planar rational curves

Computer Aided Geometric Design
Implicitization of Rational Parametric Curves and Surfaces

AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Recognizing and parametrizing curves isomorphic to a line

Journal of Symbolic Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.