一种求解面积通用矩形布局的多项式时间算法
A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts
摘要:
矩形布局$\mathcal{L}$是一个矩形,该矩形被分割成不相交的较小矩形,使得没有四个较小矩形在同一点相交。矩形布局最初被用作VLSI设计中的布图,以表示VLSI芯片布局。最近,它们被用于图形绘制中作为矩形地图。在这些应用中,区域$a(r)$被分配给每个矩形$r$,并且要求$\mathcal{L}$中的$r$的实际面积为$a(r)$。此外,一些应用程序要求我们使用组合等价的矩形布局来表示多个区域分配函数。如果对它的矩形的任何区域分配可以通过组合上等价于$\mathcal{L}$的布局来实现,则$\mathcal{L}$被称为{ \em区域通用}。这方面的一个基本问题是确定给定的平面图$G$是否具有区域通用矩形布局。在\cite{EMSV12}中给出了求解该问题的固定参数易处理算法。他们的算法需要$O(2^{O(K^2)}n^{O(1)})$时间(其中$K$是任何最小分离分量中4度顶点的最大数量),在一般情况下是指数时间。如何找到一个真正的多项式时间算法来解决这个问题是一个公开的问题。在本文中,我们描述了这样一个多项式时间算法。这篇论文已经修改了许多版本。对于以前的版本,熟悉区域通用矩形布局的设计者总是对我们算法的正确性产生同样的怀疑。他们怀疑我们的算法将两个\emph{conflicting} REL组合在一起会给出错误的输出。在当前版本中,我们意识到了以前算法的这个关键问题,我们将提供两个小节5.3和5.4来解决这个问题。(一种回溯算法,用于检测错误输出。)
英文摘要:
A rectangular layout $\mathcal{L}$ is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent VLSI chip layouts. More recently, they are used in graph drawing as rectangular cartograms. In these applications, an area $a(r)$ is assigned to each rectangle $r$, and the actual area of $r$ in $\mathcal{L}$ is required to be $a(r)$. Moreover, some applications require that we use combinatorially equivalent rectangular layouts to represent multiple area assignment functions. $\mathcal{L}$ is called {\em area-universal} if any area assignment to its rectangles can be realized by a layout that is combinatorially equivalent to $\mathcal{L}$. A basic question in this area is to determine if a given plane graph $G$ has an area-universal rectangular layout or not. A fixed-parameter-tractable algorithm for solving this problem was obtained in \cite{EMSV12}. Their algorithm takes $O(2^{O(K^2)}n^{O(1)})$ time (where $K$ is the maximum number of degree 4 vertices in any minimal separation component), which is exponential time in general case. It is an open problem to find a true polynomial time algorithm for solving this problem. In this paper, we describe such a polynomial time algorithm. This paper has been revised for many versions. For previous versions, referrers who are familiar with area-universal rectangular layouts always have the same doubt for the correctness of our algorithm. They doubt that our algorithm will give a wrong output which combine two \emph{conflicting} REL together. In the current version, we realize this critical issue for the previous algorithm and we will provide two subsections 5.3 and 5.4 to solve this issue. (A backtracking algorithm to detect wrong outputs.)
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。