Orientation-Constrained Rectangular Layouts
Computational Geometry
2009-04-29 v1
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.
Keywords
Cite
@article{arxiv.0904.4312,
title = {Orientation-Constrained Rectangular Layouts},
author = {David Eppstein and Elena Mumford},
journal= {arXiv preprint arXiv:0904.4312},
year = {2009}
}
Comments
To appear at Algorithms and Data Structures Symposium, Banff, Canada, August 2009. 12 pages, 5 figures