Topology Preserving Constrained Graph Layout

@inproceedings{Dwyer2008TopologyPC,
  title={Topology Preserving Constrained Graph Layout},
  author={Tim Dwyer and Kim Marriott and Michael Wybrow},
  booktitle={Graph Drawing},
  year={2008}
}
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… CONTINUE READING
Highly Cited
This paper has 69 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

69 Citations

0510'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Drawing Graphs: Methods and Models, chap

  • M. Eiglsperger, S. P. Fekete, G. W. Klau
  • Orthogonal graph drawing, pp. 121–171. Springer…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…