一种基于二叉树结构表达的二维实体布局算法

A binary tree based algorithm for two dimensional packing

利用二叉树表达二维实体布局问题，得到一个完全自动的二维实体布局算法，算法的复杂性Ｏ（ｎ），其中ｎ是区域树的结点数；提出了区域树面积因子，子树正方形、正方形子树新概念，给出了一个精美的旋转区域树的方法，证明了若干基本定理。

With binary tree representing for two dimensional packing, an auto algorithm for two dimensional packing was given. The complexity of the algorithm O(n) for the region tree with n nodes raised such new concepts as region tree area factor, subtree square and square subtree, proposed an elegant method for rotating binary tree and proved some basic theorems.