Topology Preserving Constrained Graph Layout
Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2009) Topology Preserving Constrained Graph Layout. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 230-241 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_22).
Full text not available from this repository.
Constrained graph layout is a recent generalisation of force-directed 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.
Repository Staff Only: item control page