A rectangular floorplan (RFP) is a partition of a rectangle $\mathcal{R}$ into rectangles ${\mathcal{R}}_1,{\mathcal{R}}_2,\dots ,{\mathcal{R}}_n$ such that no four of them meet at a point. Rectangular floorplans find their applications in VLSI circuits floorplanning and architectural floorplanning. Let $\mathcal{G}$ represent the graph of a rectangular floorplan RFP${}_1(n)$ and $\mathcal{H}$ be a subgraph of $\mathcal{G}$, where n denotes the number of rectangles in RFP${}_1(n)$. It is well known that every subgraph of $\mathcal{G}$ may not admit an RFP, i.e., $\mathcal{G}$ does not have a hereditary property. Hence, in this paper, we first derive a necessary and sufficient condition for $\mathcal{H}$ to admit a rectangular floorplan RFP${}_2(n)$. Further, if $\mathcal{H}$ admits an RFP, we present a linear time transformation algorithm for deriving RFP${}_2(n)$ from RFP${}_1(n)$.

矩形平面图（RFP）是矩形的一部分 $\mathcal{[R}$ 变成矩形 ${\mathcal{[R}}_{\mathrm{1个}}，{\mathcal{[R}}_{\mathrm{2个}}，\dots ，{\mathcal{[R}}_{ñ}$这样一来，他们当中就没有四个会合。矩形平面图在VLSI电路平面图和建筑平面图中得到了应用。让$\mathcal{G}$ 表示矩形平面图RFP的图形${}_{\mathrm{1个}}（ñ）$ 和 $\mathcal{H}$ 成为...的子图 $\mathcal{G}$，其中n表示RFP中的矩形数${}_{\mathrm{1个}}（ñ）$。众所周知，$\mathcal{G}$ 可能不接受RFP，即 $\mathcal{G}$没有遗传属性。因此，在本文中，我们首先得出$\mathcal{H}$ 接受矩形平面图RFP${}_{\mathrm{2个}}（ñ）$。此外，如果$\mathcal{H}$ 承认RFP，我们提出了一种线性时间变换算法，用于推导RFP${}_{\mathrm{2个}}（ñ）$ 来自RFP${}_{\mathrm{1个}}（ñ）$。