Abstract
In this paper, we present an efficient algorithm to construct shape curves for floorplans. Our algorithm is based on extensions of the tree-restructuring technique in [5] and the curve-adding technique in [2]. We assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Our algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that our algorithm performs well.
| Original language | English (US) |
|---|---|
| Title of host publication | Proc Eur Conf Des Autom |
| Publisher | Publ by IEEE |
| Pages | 356-360 |
| Number of pages | 5 |
| ISBN (Print) | 0818626453 |
| State | Published - 1992 |
| Externally published | Yes |
| Event | Proceedings the European Conference on Design Automation - Amsterdam, Neth Duration: Mar 16 1992 → Mar 19 1992 |
Other
| Other | Proceedings the European Conference on Design Automation |
|---|---|
| City | Amsterdam, Neth |
| Period | 3/16/92 → 3/19/92 |
ASJC Scopus subject areas
- Engineering(all)