Orientation-constrained rectangular layouts

D. Eppstein, E. Mumford

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationAlgorithms and Data Structures (Proceedings 11th International Workshop, WADS 2009, Banff, Alberta, Canada, August 21-23, 2009)
EditorsF. Dehne, M. Gavrilova, J.-R. Sack, C.D. Tóth
Place of PublicationBerlin
PublisherSpringer
Pages266-277
ISBN (Print)978-3-642-03366-7
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5664
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Orientation-constrained rectangular layouts'. Together they form a unique fingerprint.

Cite this