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

树的低层图纸

Low Ply Drawings of Trees

Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hančl, Michael Kaufmann, Stephen Kobourov, Antonios Symvonis, Pavel Valtr

摘要:

我们考虑最近引入的模型\emph{low ply graph drawing},其中的顶点的圆盘没有很多共同的重叠,这导致在一个良好的分布的顶点在平面上。在直线图中,顶点的\emph{ply-disk}是以该顶点为中心的圆盘,其半径是其最长入射边长度的一半。具有共同重叠的最大数量的磁盘被称为图中的\emph{ply-number}。我们专注于树木。我们首先考虑的图纸的树与常数k-数,证明他们可能需要指数面积,即使是明星,他们甚至可能不存在的有界度树。然后,我们把我们的注意力转向对数的图,并证明了树的最大程度$6$总是允许这样的图纸在多项式区域。

英文摘要:

We consider the recently introduced model of \emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The \emph{ply-disk} of a vertex in a straight-line drawing is the disk centered at it whose radius is half the length of its longest incident edge. The largest number of ply-disks having a common overlap is called the \emph{ply-number} of the drawing. We focus on trees. We first consider drawings of trees with constant ply-number, proving that they may require exponential area, even for stars, and that they may not even exist for bounded-degree trees. Then, we turn our attention to drawings with logarithmic ply-number and show that trees with maximum degree $6$ always admit such drawings in polynomial area.

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

↑