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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Dwyer, T., Marriott, K., & Wybrow, M. (2009). Topology preserving constrained graph layout. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 230–241). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_22
Mendeley helps you to discover research relevant for your work.