Sciweavers

Share
CORR
2002
Springer

Compact Floor-Planning via Orderly Spanning Trees

8 years 8 months ago
Compact Floor-Planning via Orderly Spanning Trees
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 floorplan area in a rectangle of size (n - 1)
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Comments (0)
books