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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Eppstein, D., & Mumford, E. (2009). Orientation-constrained rectangular layouts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5664 LNCS, pp. 266–277). https://doi.org/10.1007/978-3-642-03367-4_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
