Abstract
How to construct a digitization of a straight line and how to be able to recognize a straight line in a set of pixels are very important topics in computer graphics. The aim of the present paper is to give a mathematically exact and consistent description of digital straight lines according to Rosenfeld’s definition. The digitizations of lines with slopes 0 < a < 1 , where a is irrational, are considered. We formulate a definition of digitization runs, and formulate and prove theorems containing necessary and sufficient conditions for digital straightness. The proof was successfully constructed using only methods of elementary mathematics. The developed and proved theory can be used in research into the theory of digital lines, their symmetries, translations, etc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
