Interactive orthogonal graph drawing

IEEE Transactions on Computers

Volumn 47, Issue 11, 1998, Pages 1297-1309

  Papakostas, Achilleas ^a,b   Tollis, Ioannis G ^a,c  

^a IEEE   (United States)

^b NEC America   (United States)

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

Author keywords

Graph Drawing; Graphical user interface; Information visualization; Interactive orthogonal graph drawing; Orthogonal graph drawing

Indexed keywords

DRAWING (GRAPHICS); GRAPHICAL USER INTERFACES; INTERACTIVE DEVICES; PERFORMANCE; VISUALIZATION;

INTERACTIVE GRAPH DRAWING;

INTERACTIVE COMPUTER GRAPHICS;

EID: 0032205909     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.736444     Document Type: Article

References (25)

1. T. 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. Second Ann. European Symp. Algorithms (ESA '94), pp. 24-35, 1994.
3. R. Cohen, G. DiBattista, R. Tamassia, and I.G. Tollis, "Dynamic Graph Drawing," SIAM J. Computing, vol. 24, no. 5, pp. 970-1,001, 1995.
4. G. DiBattista, P. Eades, R. Tamassia, and I.G. Tollis, "Algorithms for Drawing Graphs: An Annotated Bibliography," Computational Geometry: Theory and Applications, vol. 4, no 5, pp. 235-282, 1994. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z, and gdbiblio.ps.Z in /pub/papers/compgeo.
5. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu, "An Experimental Comparison of Four Graph Drawing Algorithms," Computational Geometry, vol. 7, nos. 5/ 6, pp. 303-325, 1997.
6. G. DiBattista, G. Liotta, and F. Vargiu, "Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs," Proc. Workshop Algorithms and Data Structures, pp. 151-162, 1993.
7. A. Garg and R. Tamassia, "On the Computational Complexity of Upward and Rectilinear Planarity Testing," Proc. 1994 Symp. Graph Drawing (GD '94), pp. 286-297, 1994.
8. A. Garg and R. Tamassia, "A New Minimum Cost Flow Algorithm with Applications to Graph Drawing," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 201-216, 1996.
9. G. Kant, "Drawing Planar Graphs Using the Canonical Ordering," Algorithmica, special issue on graph drawing, G. Di Battista and R. Tamassia, eds., vol. 16, pp. 4-32, 1996.
10. F.T. Leighton, "New Lower Bound Techniques for VLSI," Proc. 22nd Ann. IEEE Symp. Foundations of Computer Science, pp. 1-12, 1981.
11. C.E. Leiserson, "Area-Efficient Graph Layouts (for VLSI)," Proc. 21st Ann. IEEE Symp. Foundations of Computer Science, pp. 270-281, 1980.
12. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. John Wiley and Sons, 1990.
13. K. Miriyala, S.W. Hornick and R. Tamassia, "An Incremental Approach to Aesthetic Graph Layout," Proc. Int'l Workshop Computer-Aided Software Eng. (Case '93), 1993.
14. K. Misue, P. Eades, W. Lai and K. Sugiyama, "Layout Adjustment and the Mental Map," J. Visual Languages and Computing, vol. 6, pp. 183-210, 1995.
15. S. Moen, "Drawing Interactive Trees," IEEE Software, vol. 7, pp. 21-28, 1990.
16. A. Papakostas and I.G. Tollis, "Algorithms for Area-Efficient Orthogonal Drawings," Computational Geometry Theory and Applications, vol. 9, pp. 83-110, 1998.
17. A. Papakostas and I. G. Tollis, "Improved Algorithms and Bounds for Orthogonal Drawings," Proc. 1994 Symp. Graph Drawing (GD '94), pp. 40-51, 1994.
18. A. Papakostas and I.G. Tollis, "Issues in Interactive Orthogonal Graph Drawing," Proc. 1995 Symp. Graph Drawing (GD '95), pp. 419-430, 1995.
19. A. Papakostas, J. Six, and I.G. Tollis, "Experimental and Theoretical Resultsin Interactive Graph Drawing," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 371-386, 1996.
20. K. Ryall, J. Marks, and S. Shieber, "An Interactive System for Drawing Graphs," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 387-393, 1996.
21. M. Schäffter, "Drawing Graphs on Rectangular Grids," Discrete Applied Math., vol. 63, pp. 75-89, 1995.
22. J. Storer, "On Minimal Node-Cost Planar Embeddings," Networks, vol. 14, pp. 181-212, 1984.
23. R. Tamassia and I.G. Tollis, "Planar Grid Embeddings in Linear Time," IEEE Trans. Circuits and Systems, vol. 36, pp. 1,230-1,234, 1989.
24. R. Tamassia, I.G. Tollis, and J. Vitter, "Lower Bounds for Planar Orthogonal Drawings of Graphs," Information Processing Letters, vol. 39, pp. 35-40, 1991.
25. L. Valiant, "Universality Considerations in VLSI Circuits," IEEE Trans. Computers, vol. 30, no 2, pp. 135-140, Feb. 1981.