基于有序生成树的紧凑布局规划
Compact Floor-Planning via Orderly Spanning Trees
摘要：
布图规划是超大规模集成电路芯片设计中的一个基本步骤。基于有序生成树的概念，我们给出了一个简单的O（n）时间算法来构造任意n节点平面三角网的平面图。与文献中的布图规划算法相比，我们的解决方案不仅在算法本身更简单，但也产生的布图，需要较少的模块类型。我们的新算法的一个同样重要的方面在于，它能够适应在一个矩形大小（n-1）x（2n+1）/3的平面图面积。文中还给出了平面三角剖分平面规划最坏情况下面积的下界。
英文摘要：
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for any n-node plane triangulation. In comparison with previous floor-planning algorithms in the literature, our solution is not only simpler in the algorithm itself, but also produces floor-plans which require fewer module types. An equally important aspect of our new algorithm lies in its ability to fit the floor-plan area in a rectangle of size (n-1)x(2n+1)/3. Lower bounds on the worst-case area for floor-planning any plane triangulation are also provided in the paper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
