On area-efficient drawings of rectangular duals for VLSI floor-plan

  title={On area-efficient drawings of rectangular duals for VLSI floor-plan},
  author={Katsunori Tani and Shuji Tsukiyama and Shoji Shinoda and Isao Shirakawa},
  journal={Math. Program.},
In this paper, we consider a problem to seek a rectangular dual /~ and its area-efficient drawing such that / ) can be drawn in the smallest area among all rectangular duals under the constraints imposed not only on the area and the minimum dimension of each face but also on the length of abutment between two adjacent faces. Since the problem is hard to solve, we tackle this problem in an exhaustive manner by using an algorithm to enumerate all the rectangular duals. In order to make this… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.

A problem on rectangular floorplan

  • S. L. Hakami
  • Proceedings of International Symposium on…
  • 1988
2 Excerpts

I . Cederbaum , " Floorplans , planar graphs , and layouts

  • K. Koike Tsukiyama, K. Tani Tsukiyama, I. Shirakawa, I. Koren Wimer
  • IEEE Transactions on Circuits and Systems
  • 1988

Rectangular dualization and rectangular dissections

  • K. Kozminski, E. Kinnen
  • IEEE Transactions on Circuits and Systems 35(11…
  • 1988

A chip floor-plan technique with the use of rectangular dual graph

  • K. Koike, M. H. Yoo, K. Tani, S. Tsukiyama, 1. Shirakawa
  • Monograph o f lECE of Japan CAS 85-144 (). [In…
  • 1986
1 Excerpt

A new algorithm for floorplan design

  • R.H.J.M. Otten, Efficient floorplan optimization, +24 authors C. L. Liu
  • Proceedings of the 23rd Design Automation…
  • 1986
2 Excerpts

Stockmeyer , " Optimal orientations of cells in slicing floorplan designs

  • I. Shirakawa
  • Proceedings of Joint Technical Conference on…
  • 1983

Graph Algorithms (Computer Science Press, Potomac, MD

  • S. Even
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…