Orientation-Constrained Rectangular Layouts

Simple item page
dc.creatorEppstein, David
dc.creatorMumford, Elena
dc.date2009-04-28
dc.date.accessioned2026-07-07T13:09:21Z
dc.date.available2026-07-07T13:09:21Z
dc.descriptionWe 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.
dc.descriptionTo appear at Algorithms and Data Structures Symposium, Banff, Canada, August 2009. 12 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/0904.4312
dc.identifierhttp://arxiv.org/abs/0904.4312
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/228702
dc.subjectComputational Geometry
dc.subjectF.2.2
dc.titleOrientation-Constrained Rectangular Layouts
dc.typetext

Files

Collections

arXiv