摘要
利用二叉树表达二维实体布局问题,得到一个完全自动的二维实体布局算法,算法的复杂性O(n),其中n是区域树的结点数;提出了区域树面积因子,子树正方形、正方形子树新概念,给出了一个精美的旋转区域树的方法,证明了若干基本定理。
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.
出处
《佛山科学技术学院学报(自然科学版)》
CAS
1999年第2期3-8,共6页
Journal of Foshan University(Natural Science Edition)