Abstract
In this paper we examine the relations between the code of discrete straight lines and some geometrical transformations operating on them. This will permit us to give a geometrical interpretation of Euclid's algorithm by means of these transformations. Next we shall give two applications: • an algorithm determining the run length slices of these straight lines. • a recognition algorithm of straight-line segments giving the characteristics of these segments when the test is positive.
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.
