Edge routing with ordered bundles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7034 LNCS, Issue , 2012, Pages 136-147

  Pupyrev, Sergey ^a   Nachmanson, Lev ^b   Bereg, Sergey ^c   Holroyd, Alexander E ^b  

^a URAL FEDERAL UNIVERSITY   (Russian Federation)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; CROSSING MINIMIZATION; EFFICIENT ALGORITHM; GRAPH STRUCTURES; NP-HARD; TOTAL LENGTH; WEIGHTED SUM; EDGE BUNDLING; METRO LINES; NEW APPROACHES;

ALGORITHMS;

DRAWING (GRAPHICS);

EID: 84455182364     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25878-7_14     Document Type: Conference Paper

References (14)

1. Chen, H.-F.S., Lee, D.T.: On crossing minimization problem. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems 17, 406-418 (1998) (Pubitemid 128742036)
2. Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE Trans. on Visualization and Computer Graphics 14(6), 1277-1284 (2008)
3. Dwyer, T., Nachmanson, L.: Fast Edge-Routing for Large Graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 147-158. Springer, Heidelberg (2010)
4. Gansner, E., Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: Proc. IEEE Pacific Visualization Symposium (to appear, 2011)
5. Gansner, E.R., Koren, Y.: Improved Circular Layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386-398. Springer, Heidelberg (2007)
6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
7. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. Int. Conf. on Management of Data, pp. 47-57 (1984) (Pubitemid 15469534)
8. Holten, D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics 12(5), 741-748 (2006) (Pubitemid 44955599)
9. Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Computer Graphics Forum 28(3), 983-990 (2009)
10. Lambert, A., Bourqui, R., Auber, D.: Winding Roads: Routing edges into bundles. Computer Graphics Forum 29(3), 853-862 (2010)
11. Nachmanson, L., Robertson, G., Lee, B.: Drawing Graphs with GLEE. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 389-394. Springer, Heidelberg (2008)
12. Nöllenburg, M.: An Improved Algorithm for the Metro-Line Crossing Minimization Problem. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 381-392. Springer, Heidelberg (2010)
13. Pupyrev, S., Nachmanson, L., Kaufmann, M.: Improving Layered Graph Layouts with Edge Bundling. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 329-340. Springer, Heidelberg (2011)
14. Gephi dataset, http://wiki.gephi.org/index.php?title=Datasets