Abstract
Orthogonally drawn hypergraphs have important applications, e. g. in actor-oriented data flow diagrams for modeling complex software systems. Graph drawing algorithms based on the approach by Sugiyama et al. place nodes into consecutive layers and try to minimize the number of edge crossings by finding suitable orderings of the nodes in each layer. With orthogonal hyperedges, however, the exact number of crossings is not determined until the edges are actually routed in a later phase of the algorithm, which makes it hard to evaluate the quality of a given node ordering beforehand. In this paper, we present and evaluate two cross counting algorithms that predict the number of crossings between orthogonally routed hyperedges much more accurately than the traditional straight-line method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 11(2), 109–125 (1981)
Eschbach, T., Guenther, W., Becker, B.: Orthogonal hypergraph drawing for improved visibility. Journal of Graph Algorithms and Applications 10(2), 141–157 (2006)
Sander, G.: Layout of directed hypergraphs with orthogonal hyperedges. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 381–386. Springer, Heidelberg (2004)
Barth, W., Mutzel, P., Jünger, M.: Simple and efficient bilayer cross counting. Journal of Graph Algorithms and Applications 8(2), 179–194 (2004)
Eschbach, T., Guenther, W., Becker, B.: Crossing reduction for orthogonal circuit visualization. In: Proceedings of the 2003 International Conference on VLSI, pp. 107–113. CSREA Press (2003)
Nagamochi, H., Yamada, N.: Counting edge crossings in a 2-layered drawing. Information Processing Letters 91(5), 221–225 (2004)
Waddle, V., Malhotra, A.: An E logE line crossing algorithm for levelled graphs. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 59–71. Springer, Heidelberg (1999)
Eker, J., Janneck, J.W., Lee, E.A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., Xiong, Y.: Taming heterogeneity—the Ptolemy approach. Proceedings of the IEEE 91(1), 127–144 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spönemann, M., Schulze, C.D., Rüegg, U., von Hanxleden, R. (2014). Counting Crossings for Layered Hypergraphs. In: Dwyer, T., Purchase, H., Delaney, A. (eds) Diagrammatic Representation and Inference. Diagrams 2014. Lecture Notes in Computer Science(), vol 8578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44043-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-44043-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44042-1
Online ISBN: 978-3-662-44043-8
eBook Packages: Computer ScienceComputer Science (R0)