Extending Partial Representations of Rectangular Duals with Given Contact Orientations

TL;DR

This paper presents methods to determine and construct extensions of partial rectangular dual representations with fixed contact orientations, using combinatorial characterizations and linear programming for efficient solutions.

Contribution

It introduces a linear-time characterization and construction algorithm for extending partial rectangular duals with given contact orientations, and formulates the problem as a linear program.

Findings

Linear-time characterization of extendable RELs

Efficient linear-time construction of extensions

Linear programming formulation for simultaneous representations

Abstract

A rectangular dual of a graph $G$ is a contact representation of $G$ by axis-aligned rectangles such that (i)~no four rectangles share a point and (ii)~the union of all rectangles is a rectangle. The partial representation extension problem for rectangular duals asks whether a given partial rectangular dual can be extended to a rectangular dual, that is, whether there exists a rectangular dual where some vertices are represented by prescribed rectangles. Combinatorially, a rectangular dual can be described by a regular edge labeling (REL), which determines the orientations of the rectangle contacts. We describe two approaches to solve the partial representation extension problem for rectangular duals with given REL. On the one hand, we characterise the RELs that admit an extension, which leads to a linear-time testing algorithm. In the affirmative, we can construct an extension in linear time. This partial representation extension problem can also be formulated as a linear program (LP). We use this LP to solve the simultaneous representation problem for the case of rectangular duals when each input graph is given together with a REL.