Linear binary tree
Linear binary tree
复制标题
DOI：
10.1109/icpr.1988.28296
复制
发表时间：
1988-11
期刊：
影响因子：
--
通讯作者：
C. Chuanbo;Z. Haiming
中科院分区：
文献类型：
--
作者：
C. Chuanbo;Z. Haiming
提出了一种二值图像的表示方法。这种方法称为线性二叉树（LBT），比线性四叉树（LQT）方法更有效。LBT可以通过用二进制整数编码每个黑色节点来表示，该二进制整数的数字反映连续的二分之一细分。讨论了LBT和LQT之间的关系，并将LBT上的一些算法的空间复杂度和时间复杂度与LQT进行了比较。提出了用于编码LBT和用于寻找用于搜索、并和交操作的相邻节点的方法。LBT的空间效率比LQT有上级的优势。
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.>