International Symposium on Graph Drawing

GD 2006: Graph Drawing pp 8-19

Integrating Edge Routing into Force-Directed Layout

  • Tim Dwyer
  • Kim Marriott
  • Michael Wybrow
Conference paper

DOI: 10.1007/978-3-540-70904-6_3

Volume 4372 of the book series Lecture Notes in Computer Science (LNCS)

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.

Keywords

graph layoutconstrained optimisationforce-directed layoutedge routing
Download to read the full conference paper text

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Tim Dwyer
    • 1
  • Kim Marriott
    • 1
  • Michael Wybrow
    • 1
  1. 1.Clayton School of Information Technology, Monash University, Clayton, Victoria 3800Australia