Computation of the dual of a plane projective curve

Authors:
Driss Bouziane;M'hammed El Kahoui
Affiliations:
Department of Mathematics, Faculty of Sciences Semlalia, Cadi Ayyad University, P.O. Box 2390, Marrakech, Morocco;Department of Mathematics, Faculty of Sciences Semlalia, Cadi Ayyad University, P.O. Box 2390, Marrakech, Morocco
Venue:
Journal of Symbolic Computation
Year:
2002

Citing 6
Cited 3

An algorithm for computing an integral basis in an algebraic function field

Journal of Symbolic Computation
An improved upper complexity bound for the topology computation of a real algebraic plane curve

Journal of Complexity - Special issue for the Foundations of Computational Mathematics conference, Rio de Janeiro, Brazil, Jan. 1997
On computing the dual of a plane algebraic curve

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
New structure theorem for subresultants

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Subresultants Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics

Algorithms to compute the topology of orientable real algebraic surfaces

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Topology of real algebraic space curves

Journal of Symbolic Computation
Some constructions for real algebraic curves

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe an algorithm for computing the dual of a projective plane curve. The algorithm requires no extension of the field of coefficients of the curve and runs in polynomial time.