In discrete mathematics, a rectangulation (or mosaic floorplan) R {\displaystyle {\mathcal {R}}} is a decomposition of a rectangle into finitely many interior-disjoint rectangles. The size of a rectangulation describes the number of rectangles used in the decomposition. A segment s {\displaystyle s} of a rectangulation is a maximal straight line segment, which is not contained in a side of R {\displaystyle {\mathcal {R}}} . The neighbors of a segment s {\displaystyle s} are those segments with an endpoint on s . {\displaystyle s.} If no four rectangles meet in a point the rectangulation is called generic (or mosaic). Furthermore, every generic rectangulation of size n {\displaystyle n} has exactly n − 1 {\displaystyle n-1} segments. This article will consider every rectangulation to be generic, if not stated otherwise. This topic is closely related to guillotine partitions and has applications in integrated circuit design, where floorplanning represents an early step in the design flow.
Definitions
Left-right and above-below order on rectangles A rectangle r {\displaystyle r} of the is to the left of a rectangle r ~ {\displaystyle {\tilde {r}}} if there exists a sequence of rectangles r = r 1 , r 2 , … , r k = r ~ {\displaystyle r=r_{1},r_{2},\ldots ,r_{k}={\tilde {r}}} , such that for i = 1 , … , k − 1 {\displaystyle i=1,\ldots ,k-1} the right side of r i {\displaystyle r_{i}} is contained in the same segment as the left side of r i + 1 {\displaystyle r_{i+1}} . In this case we equivalently say r ~ {\displaystyle {\tilde {r}}} is to the right of r {\displaystyle r} . A rectangle r {\displaystyle r} of the is above a rectangle r ~ {\displaystyle {\tilde {r}}} if there exists a sequence of rectangles r = r 1 , r 2 , … , r k = r ~ {\displaystyle r=r_{1},r_{2},\ldots ,r_{k}={\tilde {r}}} , such that for i = 1 , … , k − 1 {\displaystyle i=1,\ldots ,k-1} the top side of r i {\displaystyle r_{i}} is contained in the same segment as the bottom side of r i + 1 {\displaystyle r_{i+1}} . In this case we equivalently say r ~ {\displaystyle {\tilde {r}}} is below r {\displaystyle r} . Using this order we can show that every pair distinct of rectangles satisfies exactly one of these relations.
Weak and strong equivalence
For two rectangulations R 1 {\displaystyle {\mathcal {R}}_{1}} and R 2 {\displaystyle {\mathcal {R}}_{2}} we define two types of equivalence:
R 1 {\displaystyle {\mathcal {R}}_{1}} and R 2 {\displaystyle {\mathcal {R}}_{2}} are weakly equivalent, if there exists a (unique) bijection between the rectangles of R 1 {\displaystyle {\mathcal {R}}_{1}} and R 2 {\displaystyle {\mathcal {R}}_{2}} preserving the left-right and above-below orders.
… excerpt ends here. Continue reading the full article.






