Simple Compact Monotone Tree Drawings
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  showed how to produce a monotone drawing of an arbitrary n-vertex tree that is contained in a \(12n \times 12n\) grid.
In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most \(n \times n\).
- 3.Brocot, A.: Calcul des rouages par approximation, nouvelle methode. Revue Chronometrique 6, 186–194 (1860)Google Scholar
- 6.He, D., He, X.: Optimal monotone drawings of trees. CoRR abs/1604.03921 (2016)Google Scholar
- 10.Oikonomou, A., Symvonis, A.: Simple compact monotone tree drawings. CoRR abs/1708.09653v2 (2017). http://arxiv.org/abs/1708.09653v2