Abstract
The typical use of force-directed layout is to create organic-looking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for high-quality layout of small to medium sized graphs. In this paper we integrate edge-routing techniques into a force-directed layout method based on constrained stress majorisation. Our basic procedure takes an initial layout for the graph, including poly-line paths for the edges, and improves this layout by moving the nodes to reduce stress and moving edge bend points to straighten the edges and reduce their overall length. Separation constraints between nodes and edge bend points are used to ensure that nodes do not overlap edges or other nodes and that no additional edge crossings are introduced.
Chapter PDF
Similar content being viewed by others
References
Fisk, C.J., Isett, D.D.: ACCEL: automated circuit card etching layout. In: DAC’65: Proceedings of the SHARE design automation project, pp. 1–9. ACM Press, New York (1965)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7–15 (1989)
Bertault, F.: A force-directed algorithm that preserves edge crossing properties. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 351–358. Springer, Heidelberg (1999)
Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 44–56. Springer, Heidelberg (1999)
Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 448–453. Springer, Heidelberg (2005)
Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. In: Proc. IEEE Symp. on Information Visualisation (Infovis’06), IEEE Computer Society Press, Los Alamitos (To appear, 2006)
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)
Fruchterman, T., Reingold, E.M.: Graph drawing by force-directed placement. Software - Practice and Experience 21, 1129–1164 (1991)
Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. In: SODA ’01: Proc. of the 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 246–255. ACM Press, New York (2001)
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. Journal of Algebraic Discrete Methods 4(3), 312–316 (1983)
Harel, D., Sardas, M.: Randomized graph drawing with heavy-duty preprocessing. In: AVI ’94: Proceedings of the Workshop on Advanced Visual Interfaces, Bari, Italy, pp. 19–33. ACM Press, New York (1994), doi:10.1145/192309.192319
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)
Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 435–446. Springer, Heidelberg (1997)
Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization 1(2), 103–110 (2002)
Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.C.: Implementing a general-purpose edge router. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 262–271. Springer, Heidelberg (1997)
Freivalds, K.: Curved edge routing. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 126–137. Springer, Heidelberg (2001)
Preparata, F.P., Shamos, M.I.: Computational Geometry, pp. 359–365. Springer, Heidelberg (1985)
Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153–164. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Dwyer, T., Marriott, K., Wybrow, M. (2007). Integrating Edge Routing into Force-Directed Layout. In: Kaufmann, M., Wagner, D. (eds) Graph Drawing. GD 2006. Lecture Notes in Computer Science, vol 4372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-70904-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70903-9
Online ISBN: 978-3-540-70904-6
eBook Packages: Computer ScienceComputer Science (R0)