摘要
利用二叉树表达二维实体布局问题,得到一个完全自动的二维实体布局算法,算法的复杂性为O(n),其中n是区域树的结点数,提出了区域树面积因子等新概念,给出一个精美的旋转区域树的方法,证明了若干基本定理。
Using the representing for two dimensional packing with binary tree,this paper presents an auto- algorithm for two dimensional packing. The complexity of the algorithm is O(n) for the region tree with n nodes. It presents some new concepts, for example, the region - tree - area - factor and so on. It proposes an elegant method for rotating binary tree and proves some basic theorems.
出处
《计算机与数字工程》
1999年第3期36-40,27,共6页
Computer & Digital Engineering
关键词
二维布局
二叉树
子树正方形
数据结构
2d-packing, binary tree, subtree-square, square-subtree, region
