Existence and construction of a C-shaped module within a floorplan

DOI10.1016/J.TCS.2025.115209MaRDI QIDQ6994519zbMATH OpenFDO

Authors Rohit Lohani, Krishnendra Shekhawat

Publication date 23 April 2025

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

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115209

zbMATH Keywords

adjacencygraph algorithmgraph theorymodulesorthogonal floorplanplane triangulated graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• 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 theory of L-shaped floor-plans
• A transformation algorithm to construct a rectangular floorplan
• Compact floor-planning via orderly spanning trees
• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• Existence theorems for floorplans
• Finding All the Elementary Circuits of a Directed Graph
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Floorplanning by graph dualization: \(L\)-shaped modules
• INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
• On Finding the Rectangular Duals of Planar Triangular Graphs
• On Floor-Plan of Plane Graphs
• Optimal polygonal representation of planar graphs
• Rectangular dualization and rectangular dissections
• Rectangular duals of planar graphs
• Rectilinear duals using monotone staircase polygons
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Simple and efficient floor-planning

This page was built for publication: Existence and construction of a C-shaped module within a floorplan

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