Area-universal and constrained rectangular layouts
From MaRDI portal
Recommendations
Cited in
(41)- Table cartogram
- On the area-universality of triangulations
- A transformation algorithm to construct a rectangular floorplan
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- Aspect ratio universal rectangular layouts
- StreamTable: an area proportional visualization for tables with flowing streams
- Submodular reassignment problem for reallocating agents to tasks with synergy effects
- Extending partial representations of rectangular duals with given contact orientations
- Exploiting air-pressure to map floorplans on point sets
- Rectilinear duals using monotone staircase polygons
- Adjacency-preserving spatial treemaps
- Drawing planar graphs with prescribed face areas
- Orientation-Constrained Rectangular Layouts
- Area-universal drawings of biconnected outerplane graphs
- Contact Graphs of Circular Arcs
- scientific article; zbMATH DE number 3957173 (Why is no real title available?)
- Orthogonal cartograms with at most 12 corners per face
- Static and Dynamic Layout Problems with Varying Areas
- Rectangular layouts and contact graphs
- Transformations among rectangular partitions
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
- Adjacency-preserving spatial treemaps
- Improved approximation algorithms for box contact representations
- Area-universal rectangular layouts
- Exploiting air-pressure to map floorplans on point sets
- On area-universal quadrangulations
- Computing cartograms with optimal complexity
- Uniqueness of rectangularly dualizable graphs
- Combinatorial generation via permutation languages. III: Rectangulations
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- A theory of spherical diagrams
- Aspect ratio universal rectangular layouts
- StreamTable: an area proportional visualization for tables with flowing streams
- Efficient enumeration of transversal edge-partitions
- Patterns in rectangulations. I: -like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths
- Grand-Schnyder woods
- Combinatorics of rectangulations: old and new bijections
- Efficient generation of rectangulations via permutation languages
- Area-universality in outerplanar graphs
- On area-efficient drawings of rectangular duals for VLSI floor-plan
- Constrained floorplans in 2D and 3D
This page was built for publication: Area-universal and constrained rectangular layouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910852)
