Area-Universal and Constrained Rectangular Layouts
From MaRDI portal
Publication:2910852
DOI10.1137/110834032zbMath1251.68287OpenAlexW2082251733WikidataQ59782278 ScholiaQ59782278MaRDI QIDQ2910852
Kevin Verbeek, David Eppstein, Elena Mumford, Bettina Speckmann
Publication date: 12 September 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110834032
Related Items (24)
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Contact Graphs of Circular Arcs ⋮ Drawing Planar Graphs with Prescribed Face Areas ⋮ Orientation-Constrained Rectangular Layouts ⋮ Aspect ratio universal rectangular layouts ⋮ StreamTable: an area proportional visualization for tables with flowing streams ⋮ Area-universal drawings of biconnected outerplane graphs ⋮ RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY ⋮ Rectilinear Duals Using Monotone Staircase Polygons ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ Constrained floorplans in 2D and 3D ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ Table cartogram ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ Transformations among rectangular partitions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computing cartograms with optimal complexity ⋮ On the area-universality of triangulations ⋮ Improved approximation algorithms for box contact representations ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ On Area-Universal Quadrangulations
This page was built for publication: Area-Universal and Constrained Rectangular Layouts