| The Ontario Research Centre for Computer Algebra
The UWO ORCCA Reading Room
Abstract This paper is devoted to present a new seminumerical algorithm, and its implementation into the Computer Algebra System Maple, computing, for a given bivariate polynomial f(x,y) in Z[x,y], a linear graph representing the plane algebraic curve defined by the considered polynomial even if the considered curve has complicated singularities. The main purpose of this algorithm is to compute in the fastest way correct cualitative information about the set f(x,y)=0 that could be of further use when drawing the considered curve.
If you have any questions or comments regarding this page please send mail to