Construction of floorplans for plane graphs over polygonal boundaries
From MaRDI portal
Publication:6646742
DOI10.1007/s10878-024-01217-8MaRDI QIDQ6646742
Rohit Lohani, Krishnendra Shekhawat
Publication date: 3 December 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Improved floor-planning of graphs via adjacency-preserving transformations
- A linear-time algorithm for drawing a planar graph on a grid
- How to draw a planar graph on a grid
- Simple and efficient floor-planning
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Floorplanning by graph dualization: \(L\)-shaped modules
- A transformation algorithm to construct a rectangular floorplan
- Optimal polygonal representation of planar graphs
- 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
- Efficient Planarity Testing
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- On Floor-Plan of Plane Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Compact floor-planning via orderly spanning trees
- Computing cartograms with optimal complexity
- Proportional Contact Representations of Planar Graphs
This page was built for publication: Construction of floorplans for plane graphs over polygonal boundaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646742)
