Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm

2009/07/02 by Jan Hilmar, Hilmar, Jan, Chris Smyth +1
Computer Science · Engineering · Mathematics · #14C17 #Advanced Numerical Analysis Techniques #Algebraic Geometry (math.AG) #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #math.AC #math.AG #msc:14C17

paper · pdf · doi:10.48550/arxiv.0907.0361

arxiv created 2009/07/02 · openalex publication_date 2009/07/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.

Related

• Closed formulae for multiple roots of univariate polynomials through subresultants
• Résolution des systèmes polynomiaux: un solveur basé sur les matrices de Bezout
• Linear-time geometric algorithm for evaluating Bézier curves
• Newton-Puiseux algorithm and triple points for planes curves
• Algebraic Curves in Parallel Coordinates - Avoiding the "Over-Plotting" Problem