Abstract
Let G be an upward planar embedded digraph. The classical approach used to compute an upward drawing of G consists of two steps: (i) A planar st-digraph including G is constructed adding a suitable set of dummy edges; (ii) A polyline drawing of the st-digraph is computed using standard techniques, and dummy edges are then removed. For computational reasons, the number of dummy edges added in the first step should be kept as small as possible. However, as far as we know, there is only one algorithm known in the literature to compute an st-digraph including an upward planar embedded digraph. In this paper we describe an alternative heuristic, which is based on the concept of switch-regularity introduced by Di Battista and Liotta (1998). We experimentally prove that the new heuristic significantly reduces the number of dummy edges added to determine the including st-digraph. For digraphs with low density, such a reduction has a positive impact on the quality of the final drawing and on the overall running time required by the drawing process.
This work is partially supported by the MIUR Project ALINWEB.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. on Comput. 31, 601–625 (2001)
Bertolazzi, P., Battista, G.D., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 6, 476–497 (1994)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)
Kaufmann, M., Wagner, D.: Drawing Graphs. Springer, Heidelberg (2001)
Di Battista, G., Liotta, G.: Upward planarity checking: faces are more than polygon. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 72–86. Springer, Heidelberg (1999)
Bridgeman, S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry: Theory and Applications 16, 53–93 (2000)
Didimo, W., Pizzonia, M.: Upward embeddings and orientations of undirected planar graphs. Journal of Graph Algorithms and Applications 7, 221–241 (2003)
Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Trans. on Computers 49, 826–840 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Didimo, W. (2005). Computing Upward Planar Drawings Using Switch-Regularity Heuristics. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)