Rectangular dualization and rectangular dissections
From MaRDI portal
Recommendations
Cited in
(23)- Floorplanning by graph dualization: \(L\)-shaped modules
- Enumerating floorplans with walls
- A theory of rectangular dual graphs
- Improved floor-planning of graphs via adjacency-preserving transformations
- Existence and construction of a C-shaped module within a floorplan
- Simple and efficient floor-planning
- Towards characterizing graphs with a sliceable rectangular dual
- Rectangular-radial drawings of cubic plane graphs
- Optimizing regular edge labelings
- A transformation algorithm to construct a rectangular floorplan
- Uniqueness of rectangularly dualizable graphs
- Linear-time construction of floor plans for plane triangulations
- 8k-ary grid graph models of tabular forms
- The dissection of rectangles, cylinders, tori, and Möbius bands into squares
- Rectangular duals of planar graphs
- Construction of floorplans for plane graphs over polygonal boundaries
- Transformations among rectangular partitions
- Efficient enumeration of transversal edge-partitions
- Dissections of 𝑝:𝑞 rectangles
- Embedding the dual complex of hyper-rectangular partitions
- On area-efficient drawings of rectangular duals for VLSI floor-plan
- An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection
- A theory of L-shaped floor-plans
This page was built for publication: Rectangular dualization and rectangular dissections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813827)