A theory of L-shaped floor-plans

DOI10.1016/j.tcs.2022.11.025OpenAlexW4310474922MaRDI QIDQ2110365

Krishnendra Shekhawat, Raveena

Publication date: 21 December 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.14434

zbMATH Keywords

algorithmgraph theoryadjacencyconcave corner\(L\)-shaped floor-plannon-rectangular floor-plan

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Simple and efficient floor-planning
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• Floorplanning by graph dualization: \(L\)-shaped modules
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
• Rectangular duals of planar graphs
• Existence theorems for floorplans
• Rectangular dualization and rectangular dissections
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• The Vertex Splitting Algorithm for facilities layout
• On Floor-Plan of Plane Graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Compact floor-planning via orderly spanning trees
• RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
• Area-universal rectangular layouts
• INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
• Computing cartograms with optimal complexity

This page was built for publication: A theory of L-shaped floor-plans