Simple and efficient floor-planning

Authors:
Maciej Kurowski
Affiliations:
Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
Venue:
Information Processing Letters
Year:
2003

Citing 6
Cited 1

Small sets supporting fary embeddings of planar graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Floor-planning by graph dualization: 2-concave rectilinear modules

SIAM Journal on Computing
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
On floorplans of planar graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Floor-Planning via Orderly Spanning Trees

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
On finding most optimal rectangular package plans

DAC '82 Proceedings of the 19th Design Automation Conference

Improved floor-planning of graphs via adjacency-preserving transformations

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show a new algorithm for computing in O(n) time a floor-plan of a given plane near-triangulation. We use modules which are the union of two rectangles and are T-, L- or I-shaped. Our algorithm has the following advantages: the number of T-shaped modules is at most ½(n - 2), all T-shaped modules are uniformly directed, the size of the picture is at most n × n - 1. A very important asset of our algorithm is its extraordinary simplicity.