Topology preserving constrained graph layout

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

Volumn 5417 LNCS, Issue , 2009, Pages 230-241

  Dwyer, Tim ^a   Marriott, Kim ^a   Wybrow, Michael ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DIRECTED GRAPHS; DRAWING (GRAPHICS); GRAPH ALGORITHMS;

CLUSTER BOUNDARIES; DYNAMIC GRAPH LAYOUT; GENERALISATION; GRAPH LAYOUT ALGORITHMS; GRAPH LAYOUT TECHNIQUES; LINE CONNECTORS; NODE PLACEMENT; TOPOLOGY PRESERVING;

TOPOLOGY;

EID: 68749106304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00219-9_22     Document Type: Conference Paper

References (16)

1. Bertault, F.: A force-directed algorithm that preserves edge crossing properties. In: Kratochvil, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 351-358. Springer, Heidelberg (1999)
2. Bridgeman, S.S., Fanto, J., Garg, A., Tamassia, R., Vismara, L.: InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 303-308. Springer, Heidelberg (1997)
3. Dwyer, T., Koren, Y., Marriott, K.: Drawing directed graphs using quadratic programming. IEEE Transactions on Visualization and Computer Graphics 12(4), 536-548 (2006)
4. Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics 12(5), 821-828 (2006)
5. Dwyer, T., Marriott, K., Wybrow, M.: Dunnart: A constraint-based network diagram authoring tool. In: GD 2008. LNCS, vol. 5417. Springer, Heidelberg (to appear, 2009)
6. Dwyer, T., Marriott, K., Wybrow, M.: Exploration of networks using overview+detail with constraint-based cooperative layout. IEEE Transactions on Visualization and Computer Graphics (Info Vis 2008) (to appear 2008)
7. Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 8-19. Springer, Heidelberg (2007)
8. Eiglsperger, M., Fekete, S.P., Klau, G.W.: Drawing Graphs: Methods and Models, chap. Orthogonal graph drawing, pp. 121-171. Springer, London (2001)
9. Frishman, Y., Tal, A.: Online dynamic graph drawing. In: Eurographics/IEEE-VGTC Symp. on Visualization. Eurographics Association (2007)
10. Gansner, E., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239-250. Springer, Heidelberg (2005)
11. Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. In: SODA 2001: Proc. of the 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 246-255. Society for Industrial and Applied Mathematics (2001)
12. He, W., Marriott, K.: Constrained graph layout. Constraints 3, 289-314 (1998)
13. Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7-15 (1989)
14. Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages and Computing 6(2), 183-210 (1995)
15. North, S.C., Woodhull, G.: Online hierarchical graph drawing. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 232-246. Springer, Heidelberg (2002)
16. Wybrow, M., Marriott, K., Stuckey, P.J.: Incremental connector routing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 446-457. Springer, Heidelberg (2006)