Constrained floorplans in 2D and 3D
From MaRDI portal
Publication:896113
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
- On orthogonally convex drawings of plane graphs (extended abstract)
- 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
- Two layer 3D floor planning
Cited in
(6)- Rectilinear duals using monotone staircase polygons
- A transformation algorithm to construct a rectangular floorplan
- Two layer 3D floor planning
- Enumerating Floorplans with Some Properties
- Floorplanning by graph dualization: \(L\)-shaped modules
- Floorplanning with abutment constraints based on corner block list
This page was built for publication: Constrained floorplans in 2D and 3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896113)