Name
Abstract | ||
|---|---|---|
In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line segments in the upward direction without crossings using only two different slopes. We investigate whether a given upward planar digraph admits such a drawing and, if so, how to construct it. For the fixed embedding scenario, we give a simple characterisation and a linear-time construction by adopting algorithms from orthogonal drawings. For the variable embedding scenario, we describe a linear-time algorithm for single-source digraphs, a quartic-time algorithm for series-parallel digraphs, and a fixed-parameter tractable algorithm for general digraphs. For the latter two classes, we make use of SPQR-trees and the notion of upward spirality. As an application of this drawing style, we show how to draw an upward planar phylogenetic network with two slopes such that all leaves lie on a horizontal line. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.7155/jgaa.00587 | Journal of Graph Algorithms and Applications |
DocType | Volume | Issue |
Journal | 26 | 1 |
ISSN | Citations | PageRank |
1526-1719 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan Klawitter | 1 | 1 | 1.06 |
| Tamara Mchedlidze | 2 | 136 | 25.56 |