(更快)多边边界标记
(Faster) Multi-Sided Boundary Labelling
摘要:
单折弯边界标记问题由轴对齐的矩形$B$、内部的$n$点(称为站点)和沿$B$边界的标记上的$n$点(称为端口)组成。目标是找到一组与$n$轴对齐的曲线(称为引线),每条曲线最多有一个弯曲,并将一个站点连接到一个端口,以使引线成对不相交。如果端口出现在$B$的$k$不同侧,则1-折弯边界标记问题为$k$侧($1\leq k\leq 4$)。Kindermann等人[“Multi-Sided Boundary Labeling”,Micromica,76(1):225-258,2016]表明,可以分别在$O(n^4)$和$O(n^9)$时间内解决1-弯曲三边和四边边界标记问题。Bose等人[SWAT,12:1-12:14,2018]通过将问题简化为计算外串图中的最大独立集,将后者的运行时间改进为$O(n^6)$。在本文中,我们改进了以前的结果,给出了新的算法与运行时间$O(n^3\log n)$和$O(n^5)$,以解决1-弯曲的三边和四边的边界标记问题,分别。
英文摘要:
A 1-bend boundary labelling problem consists of an axis-aligned rectangle $B$, $n$ points (called sites) in the interior, and $n$ points (called ports) on the labels along the boundary of $B$. The goal is to find a set of $n$ axis-aligned curves (called leaders), each having at most one bend and connecting one site to one port, such that the leaders are pairwise disjoint. A 1-bend boundary labelling problem is $k$-sided ($1\leq k\leq 4$) if the ports appear on $k$ different sides of $B$. Kindermann et al. ["Multi-Sided Boundary Labeling", Algorithmica, 76(1): 225-258, 2016] showed that the 1-bend three-sided and four-sided boundary labelling problems can be solved in $O(n^4)$ and $O(n^9)$ time, respectively. Bose et al. [SWAT, 12:1-12:14, 2018] improved the latter running time to $O(n^6)$ by reducing the problem to computing maximum independent set in an outerstring graph. In this paper, we improve both previous results by giving new algorithms with running times $O(n^3\log n)$ and $O(n^5)$ to solve the 1-bend three-sided and four-sided boundary labelling problems, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。