Abstract
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve over the complex numbers, we decide whether it is in fact real. Furthermore, we discuss methods for actually computing a real parametrization for a parametrizable real curve.
The first author was supported by DGICYT PB 95/0563 and UAH-Proj. E010/97.
The second author was supported by the Austrian Fonds zur Förderung der wissenschaftlichen Forschung under Proj. HySaX, P11160-TEC. Both authors were supported by the Austrian-Spanish exchange program Actión Integrada 30/97.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abhyankar S.S, Bajaj C.L., (1988), Automatic parametrization of rational curves and surfaces III: Algebraic plane curves. Computer Aided Geometric Design 5, 309–321.
Gantmacher F.R., (1959), The Theory of Matrices. Chelsea, New York.
Hilbert D., Hurwitz A. (1890), über die Diophantischen Gleichungen vom Geschlecht Null. Acta math. 14, 217–224.
Hillgarter E., Winkler F. (1998), Points on algebraic curves and the parametrization problem. In: D. Wang (ed.), Automated Deduction in Geometry, 185–203, Lecture Notes in Artif. Intell. 1360, Springer Verlag Berlin Heidelberg.
van Hoeij M. (1997), Rational parametrizations of algebraic curves using a canonical divisor. J. Symbolic Computation 23/2&3, 209–227.
Ireland K., Rosen R. (1982), A classical introduction to modern number theory. Springer Verlag, Graduate Texts in Mathematics, New York.
Mňuk M., Sendra J.R., Winkler F. (1996), On the complexity of parametrizing curves. BeitrÄge zur Algebra und Geometrie 37/2, 309–328.
Mňuk M., Winkler F. (1996), CASA — A System for Computer Aided Constructive Algebraic Geometry. In: J. Calmet and C. Limongelli (eds.), Proc. Internat. Symp. on Design and Implementation of Symbolic Computation Systems (DISCO’96), 297–307, LNCS 1128, Springer Verlag Berlin Heidelberg New York.
Recio T., Sendra J.R. (1995), Reparametrización real de curvas reales paramétricas. Proc. EACA’95, 159–168, Univ. de Cantabria, Santander, Spain.
Recio T., Sendra J.R. (1997), Real parametrizations of real curves. J. Symbolic Computation 23/2&3, 241–254.
Recio T., Sendra J.R. (1997), A really elementary proof of real Lüroth’s theorem. Revista Matemática de la Universidad Complutense de Madrid 10, 283–291.
Sendra J.R., Winkler F. (1991), Symbolic parametrization of curves. J. Symbolic Computation 12/6, 607–631.
Sendra J.R., Winkler F. (1997), Parametrization of algebraic curves over optimal field extensions. J. Symbolic Computation 23/2&3, 191–207.
Walker R.J. (1950), Algebraic curves. Princeton Unversity Press.
Winkler F. (1996), Polynomial algorithms in computer algebra. Springer-Verlag Wien New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sendra, J.R., Winkler, F. (1998). Real parametrization of algebraic curves. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055920
Download citation
DOI: https://doi.org/10.1007/BFb0055920
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64960-1
Online ISBN: 978-3-540-49816-2
eBook Packages: Springer Book Archive