Integrating Edge Routing into Force-Directed Layout

Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2007) Integrating Edge Routing into Force-Directed Layout. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 8-19(Official URL:

Full text not available from this repository.


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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-70904-6_3
Classifications: M Methods > M.400 Force-directed / Energy-based
G Algorithms and Complexity > G.999 Others

Actions (login required)

View Item View Item