Abstract
In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of binary codes, each of which represents the displacement of a pixel on the line to its immediate predecessor pixel on the line. In fact, the displacement code records the entire process of drawing a line with successive pixels and it is deterministic for each specific line. In this paper, we study the important properties of the binary representation of displacement code, called BRDC, including calculation formula, periodicity, complement, decomposition etc. At last, we put forward an efficient adaptive multi-pixel line drawing algorithm based on exploited properties of BRDC, which demonstrates that BRDC is significant for designing efficient line drawing algorithms.
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.
