• DocumentCode
    984186
  • 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
  • Volume
    36
  • Issue
    1
  • fYear
    1990
  • fDate
    1/1/1990 12:00:00 AM
  • Firstpage
    192
  • Lastpage
    197
  • 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;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.50392
  • Filename
    50392
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=984186