Abstract
We present a layout algorithm for directed hypergraphs. A hypergraph contains hyperedges that have multiple source and target nodes. Hyperedges are drawn with orthogonal segments. Nodes are organized in layers, so that for the majority of hyperedges the source nodes are placed in a higher layer than the target nodes, similar to traditional hierarchical layout [8,11]. The algorithm was implemented using ILOG JViews [10] for a project that targeted electrical signal visualization.
The full article is available via ftp://ftp.ilog.fr/private/ILOG.de/rnd/gsander/ public/hypergraph.ps.gz
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Inc., New Jersey (1999)
Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci. 61, 175–198 (1988)
Eschbach, T., Günther, W., Becker, B.: Crossing reduction for orthogonal circuit visualization. In: Proc. International Conference on VLSI, Las Vegas, pp. 107–113. CSREA Press (2003)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide through the theory of NP-Completeness. W. H. Freeman, New York (1979)
Gropp, H.: The drawing of configurations. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 267–276. Springer, Heidelberg (1996)
Johnson, D.S., Pollak, H.: Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory 11(3), 309–325 (1987)
Mäkinen, E.: How to draw a hypergraph. International Journal of Computer Mathematics 34, 177–185 (1990)
Sander, G.: Graph layout through the VCG tool. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 194–205. Springer, Heidelberg (1995)
Sander, G.: A fast heuristic for hierarchical Manhattan layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 447–458. Springer, Heidelberg (1996)
Sander, G., Vasiliu, A.: The ILOG jViews graph layout module. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 438–439. Springer, Heidelberg (2002)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Trans. Sys. Man, and Cybernetics, SMC 11(2), 109–125 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sander, G. (2004). Layout of Directed Hypergraphs with Orthogonal Hyperedges. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive