Switch-Regular Upward Planar Embeddings of Trees
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.
KeywordsDirected Tree Planar Embedding Planar Drawing Acyclic Digraph Counterclockwise Order
Unable to display preview. Download preview PDF.
- 4.Binucci, C., Giacomo, E.D., Didimo, W., Rextin, A.: Switch-regular upward planarity testing of directed trees. Technical Report RT-001-09, DIEI, Univ. Perugia (2009), http://www.diei.unipg.it/rt/rt_frames.htm
- 6.Chan, H.: A parameterized algorithm for upward planarity testing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 157–168. Springer, Heidelberg (2004)Google Scholar
- 15.Papakostas, A.: Upward planarity testing of outerplanar dags. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 298–306. Springer, Heidelberg (1995)Google Scholar