Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Floor-planning by graph dualization: 2-concave rectilinear modules
SIAM Journal on Computing
On the optimal binary plane partition for sets of isothetic rectangles
Information Processing Letters
Sliceable Floorplanning by Graph Dualization
SIAM Journal on Discrete Mathematics
Drawing graphs: methods and models
Drawing graphs: methods and models
VISI Physical Design Automation: Theory and Practice
VISI Physical Design Automation: Theory and Practice
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing Software
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Octagonal drawings of plane graphs with prescribed face areas
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A fast algorithm for area minimization of slicing floorplans
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 5.23 |
We consider orthogonal drawings of a plane graph G with specified face areas. For a natural number k, a k-gonal drawing of G is an orthogonal drawing such that the boundary of G is drawn as a rectangle and each inner face is drawn as a polygon with at most k corners whose area is equal to the specified value. In this paper, we show that every slicing graph G with a slicing tree T and a set of specified face areas admits a 10-gonal drawing D such that the boundary of each slicing subgraph that appears in T is also drawn as a polygon with at most 10 corners. Such a drawing D can be found in linear time.