Authors
David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek
Publication date
2012
Journal
SIAM Journal on Computing
Volume
41
Issue
3
Pages
537-564
Publisher
Society for Industrial and Applied Mathematics
Description
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignments. A layout is area-universal if any assignment of areas to rectangles can be realized by a combinatorially equivalent rectangular layout. We identify a simple necessary and sufficient condition for a rectangular layout to be area-universal: a rectangular layout is area-universal if and only if it is one-sided. We also investigate similar questions for perimeter assignments. The adjacency requirements for the rectangles of a rectangular layout can be specified in various ways, most commonly via the dual graph of the layout. We show …
Total citations
20092010201120122013201420152016201720182019202020212022202320244545109126673815995
Scholar articles
D Eppstein, E Mumford, B Speckmann, K Verbeek - SIAM Journal on Computing, 2012
D Eppstein, E Mumford, B Speckmann, K Verbeek - Proceedings of the twenty-fifth annual symposium on …, 2009