Abstract
A period on digital line segments is defined. It is shown that each of the two nearest supports contains a preimage of the digital line segment and at least one of them contains two points of the digital line segment. Linear time algorithms are presented which find the nearest support of a 2-D digital line segment, four and eight parameters that represent 2-D and 3-D digital line segments, respectively, and construct the complete set of preimages of 2-D and 3-D digital line segments.
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.
