Orientation-Constrained Rectangular Layouts

TL;DR

This paper presents a method for constructing rectangle partitions with orientation constraints based on a planar dual graph, providing polynomial-time algorithms for layout construction and enumeration.

Contribution

It introduces a novel approach to generate orientation-constrained rectangular layouts efficiently from planar dual graphs.

Findings

Constructs rectangle partitions from planar dual graphs with orientation restrictions.

Provides polynomial-time algorithms for layout construction and enumeration.

Enables systematic listing of all possible orientation-constrained layouts.

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.