Logo

Login | Create Account

Layout of Directed Hypergraphs with Orthogonal Hyperedges (Extended Abstract)

Sander, Georg (2004) Layout of Directed Hypergraphs with Orthogonal Hyperedges (Extended Abstract). [Conference Paper]

Warning

There is a more recent version of this eprint available. Click here to view it.

Full text not available from this repository.

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.

Item Type:Conference Paper
Classifications:P Styles > P.420 Hyper
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:467
Deposited By:Selbach, Anna
Deposited On:09 Dec 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2912&spage=381

Available Versions of this Item

Repository Staff Only: item control page

References

G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing. Pretice Hall, Inc., New Jersey, 1999.

G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61:175-198, 1988.

T. Eschbach, W. Günther, and B. Becker. Crossing reduction for orthogonal circuit Visualization. In Proc. International Conference on VLSI, Las Vegas, pages 107-113. CSREA Press, 2003.

M. R. Garey and D. S. Johnson. Computers and intractability: A guide through the story of NP-Completeness. W. H. Freeman, New York, NY, 1979.

H. Gropp. The drawing of configurations. In Proc. Symposium on Graph Drawing, GD '95, pages 267-276. Springer, LNCS 1027, 1996.

D. S. Johnson and H. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory, 11(3):309-325, 1987.

E. Mäkinen. How to draw a hypergraph. International Journal of Computer Mathematics, 34:177-185, 1990.

G. Sander. Graph layout through the VCG tool. In Proc. DIMACS International Workshop on Graph Drawing, GD '94, pages 194-205. Springer, LNCS 894, 1995.

G. Sander. A fast heuristic for hierarchical Manhattan layout module. In Proc. Symposium on Graph Drawing, GD'95, pages 447-458. Springer, LNCS 1027, 1996.

G. Sander and A. Vasiliu. The ILOG JViews graph layout module. In Proc. Symposium on Graph Drawing, GD 2001, pages 438-439. Springer, LNCS 2265, 2002.

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Sys. Man, and Cybernetics, SMC 11(2):109-125, 1981.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.