Department of Computer Science, University of Maryland, College Park, MD 20742.
IEEE Trans Pattern Anal Mach Intell. 1981 Jan;3(1):93-5. doi: 10.1109/tpami.1981.4767054.
An algorithm is presented for constructing a quadtree for a binary image given its row-by-row description. The algorithm processes the image one row at a time and merges identically colored sons as soon as possible, so that a minimal size quadtree exists after processing each pixel. This method is spacewise superior to one which reads in an entire array and then attempts to build the quadtree.
本文提出了一种针对二值图像的四叉树构建算法，其输入为逐行描述。该算法每次处理一行图像，并尽快合并具有相同颜色的子节点，以便在处理完每个像素后生成最小尺寸的四叉树。与先读取整个数组再尝试构建四叉树的方法相比，该方法在空间上具有优势。
