## Floor-Planning via Orderly Spanning Trees
Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun
(2002)
Full text not available from this repository. ## AbstractFloor-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)\times \left\lfloor\frac{2n+1}{3}\right\rfloor.
Repository Staff Only: item control page References |