A tracking algorithm for implicitly defined curves

A tracking algorithm is given for curves that have equations of the form f(x,y)=0. It produces the next approximating pixel by looking for a sign difference in function evaluations at midpoints between the eight nearest neighboring pixels. The search proceeds in order of decreasing likelihood, examining the most probable candidates first.<
>