Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Richard E. Chandler (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: