Orientation-Constrained Rectangular Layouts
From MaRDI portal
Abstract: We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.
Recommendations
Cites work
- scientific article; zbMATH DE number 3698979 (Why is no real title available?)
- Area-universal and constrained rectangular layouts
- Compact floor-planning via orderly spanning trees
- Generating random elements of finite distributive lattices
- Graph Drawing
- On rectangular cartograms
- Rectangular duals of planar graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
Cited in
(5)
This page was built for publication: Orientation-Constrained Rectangular Layouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183461)