Experimental and theoretical results in interactive orthogonal graph drawing
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
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.25n 2. 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.
- Therese Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27–93, 1993.
- 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.
- 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. CrossRef
- 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.
- 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.
- 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.
- S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339–344. CrossRef
- Michael Himsolt, Comparing and evaluating layout algorithms within GraphEd, J. Visual Languages and Computing, vol. 6, no. 3. pp.255–73, 1995. CrossRef
- 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.
- Goos Kant, Drawing planar graphs using the Lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101–110.
- F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1–12.
- Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270–281.
- Thomas Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.
- 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.
- 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.
- A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Technical Report UTDCS-06-95, The University of Texas at Dallas, 1995.
- 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.
- A. Papakostas and I. G. Tollis, Issues in Interactive Orthogonal Graph Drawing, Proc. of GD '95, LNCS 1027, Springer-Verlag, 1995, pp. 419–430.
- Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. 63 (1995), pp. 75–89. CrossRef
- J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181–212.
- R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421–444. CrossRef
- R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230–1234. CrossRef
- Tom Sawyer Software Corp. GLT development group, Graph Layout Toolkit User's Guide, Berkeley, California, 1995.
- Tom Sawyer Software Corp. GLT development group, Graph Layout Toolkit Reference Manual Berkeley, California, 1995.
- L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans. on Comp., vol. C-30, no 2, (1981), pp. 135–140.
- Experimental and theoretical results in interactive orthogonal graph drawing
- Book Title
- Graph Drawing
- Book Subtitle
- Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996 Proceedings
- pp 371-386
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.