Abstract
A method of representing a binary image is developed. This method, called linear binary tree (LBT), is more effective than the linear quadtree (LQT) method. A LBT can be represented by encoding each black node with a binary integer whose digits reflect successive one-half subdivisions. The relation between LBT and LQT is discussed, and the space complexity and time complexity of some algorithms on LBT are compared to those of LQT. Methods for encoding LBT and for finding adjacent nodes for search, union and intersection operations are presented. The paper also shows that the space-efficiency of LBT is superior to that of LQT. >
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.
