A transformation algorithm to construct a rectangular floorplan

DOI10.1016/J.TCS.2021.04.014MaRDI QIDQ2031052zbMATH OpenOpenAlexFDO

Authors Vinod Kumar, Krishnendra Shekhawat

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

zbMATH Keywords

algorithmtransformationsubgraphVLSI circuitrectangular floorplan

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Analytic circuit theory (94C05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 1559558
• A theory of rectangular dual graphs
• On Floor-Plan of Plane Graphs
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Rectangular dualization and rectangular dissections

Cites work

• scientific article; zbMATH DE number 2080983 (Why is no real title available?)
• A bijection between permutations and floorplans, and its applications
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• A theory of rectangular dual graphs
• Area-universal and constrained rectangular layouts
• Constrained floorplans in 2D and 3D
• Existence theorems for floorplans
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Floorplans with columns
• Generic rectangulations
• Heuristic method to check the realisability of a graph into a rectangular plan
• Improved floor-planning of graphs via adjacency-preserving transformations
• On Finding the Rectangular Duals of Planar Triangular Graphs
• On Floor-Plan of Plane Graphs
• Orderly Spanning Trees with Applications
• Rectangular drawings of planar graphs
• Rectangular dualization and rectangular dissections
• Rectangular duals of planar graphs
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Sliceable Floorplanning by Graph Dualization
• The quarter-state-sequence floorplan representation

Cited in

(4)

• Improved floor-planning of graphs via adjacency-preserving transformations
• Existence and construction of a C-shaped module within a floorplan
• Construction of floorplans for plane graphs over polygonal boundaries
• Transformations among rectangular partitions

This page was built for publication: A transformation algorithm to construct a rectangular floorplan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031052)