Computer Science – Computational Geometry
Scientific paper
2009-04-28
Computer Science
Computational Geometry
To appear at Algorithms and Data Structures Symposium, Banff, Canada, August 2009. 12 pages, 5 figures
Scientific paper
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.
Eppstein David
Mumford Elena
No associations
LandOfFree
Orientation-Constrained Rectangular Layouts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Orientation-Constrained Rectangular Layouts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Orientation-Constrained Rectangular Layouts will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-712767