Computation with algebraic curves

We present a variety of computational techniques dealing with algebraic curves both in the plane and in space. Our main results are polynomial time algorithms (1) to compute the genus of plane algebraic curves, (2) to compute the rational parametric equations for implicitly defined rational plane algebraic curves of arbitrary degree, (3) to compute birational mappings between points on irreducible space curves and points on projected plane curves and thereby to compute the genus and rational parametric equations for implicitly defined rational space curves of arbitrary degree, (4) to check for the faithfulness (one to one) of parameterizations.