Experimental and theoretical results in interactive orthogonal graph drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1190, Issue , 1997, Pages 371-386

  Papakostas, Achilleas ^a   Six, Janet M ^a   Tollis, Ioannis G ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AESTHETIC PROPERTY; DESIGN PROGRESS; DRAWING PROCESS; GRAPH DRAWING; MENTAL MAPS; ORTHOGONAL GRAPHS; RELATIVE COORDINATES; THEORETICAL BOUNDS;

DRAWING (GRAPHICS);

EID: 84957710112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_61     Document Type: Conference Paper

References (25)

1. Therese Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993.
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.
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.
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.
5. G. DiBattista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Proc. of A CM Syrup. 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.
6. S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tack. Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994.
7. S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339-344.
8. Michael Himsolt, Comparing and evaluating layout algorithms within GraphEd, J. Visual Languages and Computing, vol. 6, no. 3. pp.255-73, 1995.
9. Michael Himsolt, GraphEd: a graphical platform for the implementation of graph algorithms, Proc. DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 182-193.
10. Goos Kant, Drawing planar graphs using the line-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101-110.
11. F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Syrup. on Found. of Comp. Science, 1981, pp. 1-12.
12. Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Syrup. on Found. of Comp. Science, 1980, pp. 270-281.
13. Thomas Lenganer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.
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.
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.
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.
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.
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.
19. Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. AppL Math. 63 (1995), pp. 75-89.
20. J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181-212.
21. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421-444.
22. R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230-1234.
23. Tom Sawyer Software Corp. GLT development group, Graph Layout Toolkit User's Guide, Berkeley, California, 1995.
24. Tom Sawyer Software Corp. GLT development group, Graph Layout Toolkit Reference Manual Berkeley, California, 1995.
25. L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans. on Comp., vol. C-30, no 2, (1981), pp. 135-140.