Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm
Algebraic Geometry
2009-07-03 v1 Commutative Algebra
Abstract
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
Cite
@article{arxiv.0907.0361,
title = {Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm},
author = {Jan Hilmar and Chris Smyth},
journal= {arXiv preprint arXiv:0907.0361},
year = {2009}
}