arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.0750cs.CG
收藏

多边边界标记

Multi-Sided Boundary Labeling

Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff

摘要:

在边界标记问题中,我们给出了一组$n$点,称为网站,在一个轴平行的矩形$R$,和一组$n$成对不相交的矩形标签,附加到$R$从外面。任务是通过不相交的直线路径(所谓的引线)将站点连接到标签,其中最多有一个弯曲。本文研究了多边边界标号问题,标号至少位于外接矩形的两边。我们提出了一个多项式时间算法,计算一个交叉自由领导人布局,如果存在。到目前为止,这样的算法只知道标签位于$R$的一侧或两个相对侧的情况(这里总是存在无交叉的解决方案)。标签可能位于相邻侧的情况更加困难。我们提出了有效的算法,用于测试存在的一个无交叉的领导者布局,标签的所有网站,并最大限度地提高标记的网站在一个无交叉的领导者布局的数量。对于相邻边的双边边界标记,我们进一步展示了如何在无交叉布局中最小化总引线长度。

英文摘要:

In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend. In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, such an algorithm has only been known for the cases in which labels lie on one side or on two opposite sides of $R$ (here a crossing-free solution always exists). The case where labels may lie on adjacent sides is more difficult. We present efficient algorithms for testing the existence of a crossing-free leader layout that labels all sites and also for maximizing the number of labeled sites in a crossing-free leader layout. For two-sided boundary labeling with adjacent sides, we further show how to minimize the total leader length in a crossing-free layout.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑