Rectilinear duals using monotone staircase polygons
From MaRDI portal
Recommendations
Cites work
- A simple optimal binary representation of mosaic floorplans and Baxter permutations
- Area-universal and constrained rectangular layouts
- Compact floor-planning via orderly spanning trees
- Computing cartograms with optimal complexity
- Drawing slicing graphs with face areas
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Orthogonal cartograms with few corners per face
- Rectangular duals of planar graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Cited in
(5)- Linear-time construction of floor plans for plane triangulations
- A graph theoretic approach for generating T-shaped floor plans
- Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
- Existence and construction of a C-shaped module within a floorplan
- Constrained floorplans in 2D and 3D
This page was built for publication: Rectilinear duals using monotone staircase polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942384)