Title :
The number of digital straight lines on an N×N grid
Author :
Koplowitz, J. ; Lindenbaum, M. ; Bruckstein, A.
Author_Institution :
Dept. of Electr. & Comput. Eng., Clarkson Univ., Potsdam, NY, USA
fDate :
1/1/1990 12:00:00 AM
Abstract :
The number of digital straight lines on an N×N grid is shown. A digital straight line is equivalent to a linear dichotomy of points on a square grid. The result is obtained by determining a way of counting the number of linearly separable dichotomies of points on the plane that are not necessarily in general position. The analysis is easily modified to provide a simple solution to a similar problem considered by C. Berenstein and D. Lavine (1988) on the number of digital straight lines from a fixed starting point
Keywords :
pattern recognition; digital straight lines; linear dichotomy of points; pattern recognition; square grid; Binary sequences; Communication systems; Cryptography; Delay; Hardware; Heart; Information theory; Multiplexing; Random sequences; Spread spectrum communication;
Journal_Title :
Information Theory, IEEE Transactions on
