On the number of digital straight lines on an N*N grid

The number of different digital straight lines on an N*N square pixel array is studied. The problem is equivalent to finding the number of linear dichotomies of a planar set of N/sup 2/ points of an N*N grid. For any planar set of points, adjacent pairs are defined to be pairs of points from the set such that no other point from the set lie on the line segment between them. A one-to-one correspondence between linear dichotomies and adjacent pairs is proved. Then, the adjacent pairs of points of an N*N grid are counted, and the number of linear dichotomies, as well as the number of digital straight lines, follows. An asymptotic evaluation is proved and an efficient algorithm for finding L(N) for any particular N is given.<<ETX>>