Experimental and theoretical results in interactive orthogonal graph drawing

  • Achilleas Papakostas
  • Janet M. Six
  • Ioannis G. Tollis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1190)


Interactive Graph Drawing allows the user to dynamically interact with a drawing as the design progresses while preserving the user's mental map. This paper presents a theoretical analysis of Relative-Coordinates and an extensive experimental study comparing the performance of two interactive orthogonal graph drawing scenaria: No-Change, and Relative-Coordinates. Our theoretical analysis found that the Relative-Coordinates scenario builds a drawing that has no more than 3n−1 bends, while the area of the drawing is never larger than 2.25n2. Also, no edge has more than 3 bends at any time during the drawing process. To conduct the experiments, we used a large set of test data consisting of 11,491 graphs (ranging from 6 to 100 nodes) and compared the behavior of the above two scenaria with respect to various aesthetic properties (e.g., area, bends, crossings, edge length, etc) of the corresponding drawings. The Relative-Coordinates scenario was a winner over No-Change under any aesthetic measure considered in our experiments. Moreover, the practical behavior of the two scenaria was considerably better than the established theoretical bounds, in most cases.


  1. 1.
    Therese Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27–93, 1993.Google Scholar
  2. 2.
    T. Biedl and G. Kant, A Better Heuristic for Orthogonal Graph Drawings, Proc. 2nd Ann. European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science, vol. 855, pp. 24–35, Springer-Verlag, 1994.Google Scholar
  3. 3.
    R. Cohen, G. DiBattista, R. Tamassia, and I. G. Tollis, Dynamic Graph Drawings:Trees, Series-Parallel Digraphs, and Planar st-Digraphs, SIAM Journal on Computing, vol. 24, no. 5, pp. 970–1001, 1995.CrossRefGoogle Scholar
  4. 4.
    G. DiBattista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 5, 1994, pp. 235–282. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.MathSciNetGoogle Scholar
  5. 5.
    G. DiBattista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Proc. of ACM Symp. on Computational Geometry, pp. 306–315, 1995. The version of the paper with the four algorithms can be obtained from http://www.cs.brown/people/rt.Google Scholar
  6. 6.
    S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994.Google Scholar
  7. 7.
    S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339–344.CrossRefGoogle Scholar
  8. 8.
    Michael Himsolt, Comparing and evaluating layout algorithms within GraphEd, J. Visual Languages and Computing, vol. 6, no. 3. pp.255–73, 1995.CrossRefGoogle Scholar
  9. 9.
    Michael Himsolt, GraphEd: a graphical platform for the implementation of graph algorithms, Proc. DIM ACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 182–193.Google Scholar
  10. 10.
    Goos Kant, Drawing planar graphs using the Lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101–110.Google Scholar
  11. 11.
    F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1–12.Google Scholar
  12. 12.
    Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270–281.Google Scholar
  13. 13.
    Thomas Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.Google Scholar
  14. 14.
    K. Miriyala, S. W. Hornick and R. Tamassia, An Incremental Approach to Aesthetic Graph Layout, Proc. Int. Workshop on Computer-Aided Software Engineering (Case '93), 1993.Google Scholar
  15. 15.
    K. Misue, P. Eades, W. Lai and K. Sugiyama, Layout Adjustment and the Mental Map, J. of Visual Languages and Computing, June 1995, pp.183–210.Google Scholar
  16. 16.
    A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Technical Report UTDCS-06-95, The University of Texas at Dallas, 1995.Google Scholar
  17. 17.
    A. Papakostas and I. G. Tollis, Improved Algorithms and Bounds for Orthogonal Drawings, Proc. DIMACS Workshop GD '94, LNCS 894, Springer-Verlag, 1994, pp. 40–51.Google Scholar
  18. 18.
    A. Papakostas and I. G. Tollis, Issues in Interactive Orthogonal Graph Drawing, Proc. of GD '95, LNCS 1027, Springer-Verlag, 1995, pp. 419–430.Google Scholar
  19. 19.
    Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. 63 (1995), pp. 75–89.CrossRefGoogle Scholar
  20. 20.
    J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181–212.Google Scholar
  21. 21.
    R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421–444.CrossRefGoogle Scholar
  22. 22.
    R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230–1234.CrossRefGoogle Scholar
  23. 23.
    Tom Sawyer Software Corp. GLT development group, Graph Layout Toolkit User's Guide, Berkeley, California, 1995.Google Scholar
  24. 24.
    Tom Sawyer Software Corp. GLT development group, Graph Layout Toolkit Reference Manual Berkeley, California, 1995.Google Scholar
  25. 25.
    L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans. on Comp., vol. C-30, no 2, (1981), pp. 135–140.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Achilleas Papakostas
    • 1
  • Janet M. Six
    • 1
  • Ioannis G. Tollis
    • 1
  1. 1.Department of Computer ScienceThe University of Texas at DallasRichardson

Personalised recommendations