Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules

DOI10.1137/0222035zbMath0774.05093OpenAlexW2052977033MaRDI QIDQ4202209

Kok-Hoo Yeap, Majid Sarrafzadeh

Publication date: 1 September 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222035

zbMATH Keywords

CRMplanar triangulated graphgraph dualizationfloor-planningrectangular modules

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (18)

On orthogonally convex drawings of plane graphs ⋮ Layered area-proportional rectangle contact representations ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Rectilinear Duals Using Monotone Staircase Polygons ⋮ Constrained floorplans in 2D and 3D ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Good spanning trees in graph drawing ⋮ Table cartogram ⋮ Computing cartograms with optimal complexity ⋮ Recent Developments in Floorplan Representations ⋮ Triangulating with high connectivity. ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ Drawing slicing graphs with face areas ⋮ Simple and efficient floor-planning ⋮ Proportional Contact Representations of Planar Graphs ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS ⋮ A theory of L-shaped floor-plans

This page was built for publication: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules