arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.09653cs.DScs.CGcs.DM
收藏

简单紧凑的单调树绘制

Simple Compact Monotone Tree Drawings

Anargyros Oikonomou, Antonios Symvonis

AI总结:

该研究针对树的单调绘制问题,提出简单算法,将有根树绘制压缩至n×n网格,同时给出无根有序、无序树的紧凑单调绘制方案,大幅缩小所需网格尺寸。

摘要:

图G的单调绘制是指G的一种直线绘制方式,其中每对顶点都由一条沿某个方向具有单调性的路径连接。\n树作为一类特殊的图,一直是多篇论文的研究焦点,近期He和He~\ncite{mt:4}展示了如何生成任意n顶点树的单调绘制,且该绘制可容纳在12n×12n的网格中。\n现有文献中所有的单调树绘制算法都针对有根有序树,且绘制结果满足三个条件:(i)树的根绘制在绘图原点,(ii)绘制结果限定在第一象限,(iii)遵循树的顺序/嵌入关系。本文提出了一种具有完全相同特性的简单算法,给定一棵n顶点有根树T,该算法输出的T的单调绘制可适配在n×n网格中。\n对于无根有序树,我们提出了一种算法,生成的单调绘制遵循树的顺序,且可容纳在(n+1)×(n/2 +1)的网格中;而对于无根无序树,我们生成的单调绘制具有良好的宽高比,且适配的网格尺寸至多为⌊3/4(n+2)⌋×⌊3/4(n+2)⌋。

英文摘要:

A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several papers and, recently, He and He~\cite{mt:4} showed how to produce a monotone drawing of an arbitrary $n$-vertex tree that is contained in a $12n \times 12n$ grid. All monotone tree drawing algorithms that have appeared in the literature consider rooted ordered trees and they draw them so that (i) the root of the tree is drawn at the origin of the drawing, (ii) the drawing is confined in the first quadrant, and (iii) the ordering/embedding of the tree is respected. In this paper, we provide a simple algorithm that has the exact same characteristics and, given an $n$-vertex rooted tree $T$, it outputs a monotone drawing of $T$ that fits on a $n \times n$ grid. For unrooted ordered trees, we present an algorithms that produces monotone drawings that respect the ordering and fit in an $(n+1) \times (\frac{n}{2} +1)$ grid, while, for unrooted non-ordered trees we produce monotone drawings of good aspect ratio which fit on a grid of size at most $\left\lfloor \frac{3}{4} \left(n+2\right)\right\rfloor \times \left\lfloor \frac{3}{4} \left(n+2\right)\right\rfloor$.

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

↑