UWO ORCCA TR-01-06 Summary

• PDF version of TR-01-06 (319 KBytes)
• PostScript version of TR-01-06 (596 KBytes)
• Gzipped PDF version of TR-01-06 (180 KBytes)
• Gzipped PostScript version of TR-01-06 (147 KBytes)

Efficient topology determination of implicitly defined algebraic plane curves, August 25, 2001, Laureano Gonzalez-Vega and Ioana Necula, 16 pages

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 tech-reports@orcca.on.ca.

About ORCCA	Members	Events & Seminars	ORCCA Home
Research Activities	Positions	Reading Room
Contact Info