Detecting Affine Equivalences Between Implicit Planar Algebraic Curves

We present a complete algorithm for computing the affine equivalences between two implicit planar algebraic curves. We provide evidence of the efficiency of the algorithm, implemented in Maple, and compare its performance with existing algorithms. As a part of the process for developing the algorithm, we characterize planar algebraic curves, possibly singular, possibly reducible, invariant under infinitely many affine equivalences.