A transformation algorithm to construct a rectangular floorplan
From MaRDI portal
Publication:2031052
DOI10.1016/j.tcs.2021.04.014zbMath1482.05242OpenAlexW3157836530MaRDI QIDQ2031052
Krishnendra Shekhawat, Vinod Kumar
Publication date: 8 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.014
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Analytic circuit theory (94C05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Improved floor-planning of graphs via adjacency-preserving transformations
- Generic rectangulations
- Constrained floorplans in 2D and 3D
- A theory of rectangular dual graphs
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Heuristic method to check the realisability of a graph into a rectangular plan
- Floorplans with columns
- A simple optimal binary representation of mosaic floorplans and Baxter permutations
- A bijection between permutations and floorplans, and its applications
- Area-Universal and Constrained Rectangular Layouts
- 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
- On Floor-Plan of Plane Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Rectangular drawings of planar graphs
- Sliceable Floorplanning by Graph Dualization
- Orderly Spanning Trees with Applications
- The quarter-state-sequence floorplan representation
This page was built for publication: A transformation algorithm to construct a rectangular floorplan
