Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm
arXiv:0907.0361
Abstract
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.