Monash University
tr-2008-227-full.pdf (287.71 kB)
Download file

Topology Preserving Constrained Graph Layout

Download (287.71 kB)
posted on 2022-07-25, 00:27 authored by T Dwyer, K Marriott, M Wybrow
Constrained graph layout is a recent generalization 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.


Technical report number


Year of publication


Usage metrics

    Monash Information Technology Technical Reports