Sciweavers

GD
2008
Springer

Topology Preserving Constrained Graph Layout

14 years 8 days ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.
Tim Dwyer, Kim Marriott, Michael Wybrow
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Where GD
Authors Tim Dwyer, Kim Marriott, Michael Wybrow
Comments (0)