Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
Checking the convexity of polytopes and the planarity of subdivision
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Turn-regularity and optimal area drawings of orthogonal representations
Computational Geometry: Theory and Applications
Upward Planar Drawing of Single-Source AcyclicDigraphs
SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
Upward Planarity Checking: ``Faces Are More than Polygons''
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Upward Planarity Testing of Outerplanar Dags
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Upward spirality and upward planarity testing
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
Upward planar drawings of digraphs are crossing free drawings where all edges flow in the upward direction. The problem of deciding whether a digraph admits an upward planar drawing is called the upward planarity testing problem, and it has been widely studied in the literature. In this paper we investigate a new version of this problem: Deciding whether a digraph admits a switch-regular upward planar drawing, i.e., an upward planar drawing with specific topological properties. Switch-regular upward planar drawings have applications in the design of efficient checkers and in the design of effective compaction heuristics. We provide characterizations for the class of directed trees that admit a switch-regular upward planar drawing. Based on these characterizations we describe an optimal linear-time testing and embedding algorithm.