An optimal algorithm for detecting straight lines in chain codes
J. Yuan, Ching Y. Suen · 2003
An optimal algorithm for detecting straight lines in chain codes is described. The algorithm turns the complicated problem of determining the straightness of digital arcs into a simple task by constructing a passing area around the pixels. It is shown that this algorithm is not only simple and intuitive, but also highly efficient.>