Computing parameterizations of rational algebraic curves

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing parameterizations of rational algebraic curves

Full text

Pdf (418 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the international symposium on Symbolic and algebraic computation table of contents

Oxford, United Kingdom

Pages: 187 - 190

Year of Publication: 1994

ISBN:0-89791-638-7

Author

Mark van Hoeij

Department of mathematics, University of Nijmegen, 6525 ED Nijmegen, The Netherlands

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 19, Citation Count: 4

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/190347.190415 What is a DOI?

ABSTRACT

In this paper I want to present a new method for computing parametrizations of algebraic curves. Basically this method is a direct application of integral basis computation. Examples show that this method is faster than older methods.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. S. Abhyankar , C. L. Bajaj, Automatic parameterization of rational curves and surfaces III: algebraic plane curves, Computer Aided Geometric Design, v.5 n.4, p.309-321, Nov. 1988 [doi>10.1016/0167-8396(88)90011-8]
	2	G.A. Bliss, Algebraic Functions, Dover (1966)
	3	D. Hilbert, A. Hurwitz, Ueber die Diopantischen Gleichungen yore Geschlecht Null, Acta math 14, 217-224 (1890)
	4	Mark van Hoeij, An algorithm for computing an integral basis in an algebraic function field, Journal of Symbolic Computation, v.18 n.4, p.353-363, Oct. 1994 [doi>10.1006/jsco.1994.1051]
	5	J. Rafael Sendra , Franz Winkler, Symbolic parametrization of curves, Journal of Symbolic Computation, v.12 n.6, p.607-631, Dec. 1991 [doi>10.1016/S0747-7171(08)80144-7]
	6	J.R. Sendra, F. Winkler, Determining Simple Points on Rational Algebraic Curves, Technical Report RISC 93-23 University Linz (1993)
	7	R.J. W~lker, Algebraic curves, Princeton University Press. (1950)

CITED BY 4

	Mark van Hoeij, An algorithm for computing the Weierstrass normal form, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.90-95, July 10-12, 1995, Montreal, Quebec, Canada
	Carlos Andradas , Tomás Recio , J. Rafael Sendra, A relatively optimal rational space curve reparametrization algorithm through canonical divisors, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.349-355, July 21-23, 1997, Kihei, Maui, Hawaii, United States
	R. J. Stroeker , N. Tzanakis, Computing all integer solutions of a genus 1 equation, Mathematics of Computation, v.72 n.244, p.1917-1933, October 2003
	Sonia Pérez-Díaz , Juana Sendra , J. Rafael Sendra, Parametrization of approximate algebraic curves by lines, Theoretical Computer Science, v.315 n.2-3, p.627-650, 6 May 2004