Construction of floorplans for plane graphs over polygonal boundaries

A floorplan (F) is a partition of a polygonal boundary (P) into n-regions satisfying the adjacencies given by an n-vertex graph. Here, it is assumed that the sides of the polygonal boundary are either parallel to the x-axis or y-axis or have slopes \(-1\) $-1$ or 1. For a given polygonal boundary P (having m line segments) and a plane triangulated graph G, this paper presents a linear-time algorithm for constructing a floorplan with the required polygonal boundary satisfying all given adjacencies. Further, it has been proved that the number of sides of each region in the obtained floorplan (F) is at most m + 1 (except one region, which can have at most m + 5 sides) for the given polygonal boundary P of length m.