Improving Layered Graph Layouts with Edge Bundling
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges. We give several implementations that vary in quality of the resulting layout and execution time. To diminish the number of edge crossings inside of the bundles we apply a metro-line crossing minimization technique. The method preserves the Sugiyama style of the layout and creates a more readable view of the graph.
KeywordsLayered Graph Virtual Node Original Node Compatible Pair Graph Layout
- 10.Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. In: Computer Graphics Forum, vol. 28, pp. 983–990 (2009)Google Scholar
- 11.Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review E 80(1) (2008)Google Scholar
- 13.Newbery, F.J.: Edge concentration: A method for clustering directed graphs. In: Proc. 2nd Int. Workshop on Software Configuration Management, pp. 76–85 (1989)Google Scholar
- 15.Tufte, E.R.: The Visual Display of Quantitative Information. Graphics Press, CT (1983)Google Scholar
- 16.The AT&T graph collection. http://www.graphdrawing.org.