Orientation-Constrained Rectangular Layouts

Authors:
David Eppstein;Elena Mumford
Affiliations:
Department of Computer Science, University of California, Irvine, USA;Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands
Venue:
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Year:
2009

Citing 5
Cited 2

Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science
Compact floor-planning via orderly spanning trees

Journal of Algorithms
On rectangular cartograms

Computational Geometry: Theory and Applications
Area-universal rectangular layouts

Proceedings of the twenty-fifth annual symposium on Computational geometry
Transversal structures on triangulations, with application to straight-line drawing

GD'05 Proceedings of the 13th international conference on Graph Drawing

Optimizing regular edge labelings

GD'10 Proceedings of the 18th international conference on Graph drawing
Adjacency-preserving spatial treemaps

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Quantified Score

Hi-index	0.00

Visualization

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.