Integrating edge routing into force-directed layout

Authors:
Tim Dwyer;Kim Marriott;Michael Wybrow
Affiliations:
Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia;Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia;Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 15
Cited 9

Computational geometry: an introduction

Computational geometry: an introduction
An algorithm for drawing general undirected graphs

Information Processing Letters
Graph drawing by force-directed placement

Software—Practice & Experience
Randomized graph drawing with heavy-duty preprocessing

AVI '94 Proceedings of the workshop on Advanced visual interfaces
Inserting an edge into a planar graph

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Validating Graph Drawing Aesthetics

GD '95 Proceedings of the Symposium on Graph Drawing
Implementing a General-Purpose Edge Router

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Using Graph Layout to Visualize Train Interconnection Data

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
“ACCEL” automated circuit card etching layout

DAC '65 Proceedings of the SHARE design automation project
Cognitive measurements of graph aesthetics

Information Visualization
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs

IEEE Transactions on Visualization and Computer Graphics
Fast node overlap removal

GD'05 Proceedings of the 13th international conference on Graph Drawing
Incremental connector routing

GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization

GD'04 Proceedings of the 12th international conference on Graph Drawing
Curvilinear graph drawing using the force-directed method

GD'04 Proceedings of the 12th international conference on Graph Drawing

IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs

IEEE Transactions on Visualization and Computer Graphics
Topology Preserving Constrained Graph Layout

Graph Drawing
Constrained stress majorization using diagonally scaled gradient projection

GD'07 Proceedings of the 15th international conference on Graph drawing
Fast edge-routing for large graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
Layout with circular and other non-linear constraints using procrustes projection

GD'09 Proceedings of the 17th international conference on Graph Drawing
Graph Bundling by Kernel Density Estimation

Computer Graphics Forum
Force-directed edge bundling for graph visualization

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
HD-GraphViz: highly distributed graph visualization on tiled displays

Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Improving multiple aesthetics produces better graph drawings

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

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 polyline 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.