Linear binary tree

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