A preliminary version of this paper which included the one-quadrant algorithm for monotone tree drawings was presented in the 25th International Symposium on Graph Drawing and Network Visualization, GD 2017
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$.
Streamed Graph Drawing and the File Maintenance Problem
在流式图形绘制中,平面图G作为数据流递增地给出,并且在每个新的边被释放之后必须更新G的直线图。为了保持心理地图,每次更新后,对绘图的更改应最小化,Binucci et al.show认为,如果不允许边缘移动,指数区域对于树的一些流图绘图是必要的和足够的。我们表明,一些流图图纸可以,事实上,多项式区域,包括平面流图图纸的树,树地图,和outerplanar图,如果我们允许少量的坐标移动后,每次更新。我们的算法涉及一个有趣的连接到一个经典的算法问题-文件维护问题-我们也给这个问题的新算法在一个框架中,允许大容量内存移动。