
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Achilleas Papakostas, Ioannis G. Tollis, "Interactive Orthogonal Graph Drawing," IEEE Transactions on Computers, vol. 47, no. 11, pp. 12971309, November, 1998.  
BibTex  x  
@article{ 10.1109/12.736444, author = {Achilleas Papakostas and Ioannis G. Tollis}, title = {Interactive Orthogonal Graph Drawing}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {11}, issn = {00189340}, year = {1998}, pages = {12971309}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.736444}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Interactive Orthogonal Graph Drawing IS  11 SN  00189340 SP1297 EP1309 EPD  12971309 A1  Achilleas Papakostas, A1  Ioannis G. Tollis, PY  1998 KW  Graph Drawing KW  orthogonal graph drawing KW  interactive orthogonal graph drawing KW  information visualization KW  graphical user interface. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses.
[1] T. Biedl, "Embedding Nonplanar Graphs in the Rectangular Grid," Rutcor Research Report 2793, 1993.
[2] T. Biedl and G. Kant, "A Better Heuristic for Orthogonal Graph Drawings," Proc. Second Ann. European Symp. Algorithms (ESA '94), pp. 2435, 1994.
[3] R. Cohen, G. DiBattista, R. Tamassia, and I.G. Tollis, "Dynamic Graph Drawing," SIAM J. Computing, vol. 24, no. 5, pp. 9701,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. 235282, 1994. Also available via anonymous ftp from,, andin.
[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. 303325, 1997.
[6] G. DiBattista, G. Liotta, and F. Vargiu, "Spirality of Orthogonal Representations and Optimal Drawings of SeriesParallel Graphs and 3Planar Graphs," Proc. Workshop Algorithms and Data Structures, pp. 151162, 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. 286297, 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. 201216, 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. 432, 1996.
[10] F.T. Leighton, "New Lower Bound Techniques for VLSI," Proc. 22nd Ann. IEEE Symp. Foundations of Computer Science, pp. 112, 1981.
[11] C.E. Leiserson, "AreaEfficient Graph Layouts (for VLSI)," Proc. 21st Ann. IEEE Symp. Foundations of Computer Science, pp. 270281, 1980.
[12] T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Chichester, U.K.: Wiley, 1990.
[13] K. Miriyala, S.W. Hornick, and R. Tamassia, "An Incremental Approach to Aesthetic Graph Layout," Proc. Int'l Workshop ComputerAided 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. 183210, 1995.
[15] S. Moen, "Drawing Interactive Trees," IEEE Software, vol. 7, pp. 2128, 1990.
[16] A. Papakostas and I.G. Tollis, "Algorithms for AreaEfficient Orthogonal Drawings," Computational Geometry Theory and Applications, vol. 9, pp. 83110, 1998.
[17] A. Papakostas and I. G. Tollis, "Improved Algorithms and Bounds for Orthogonal Drawings," Proc. 1994 Symp. Graph Drawing (GD '94), pp. 4051, 1994.
[18] A. Papakostas and I.G. Tollis, "Issues in Interactive Orthogonal Graph Drawing," Proc. 1995 Symp. Graph Drawing (GD '95), pp. 419430, 1995.
[19] A. Papakostas, J. Six, and I.G. Tollis, "Experimental and Theoretical Results in Interactive Graph Drawing," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 371386, 1996.
[20] K. Ryall, J. Marks, and S. Shieber, "An Interactive System for Drawing Graphs," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 387393, 1996.
[21] M. Schäffter, "Drawing Graphs on Rectangular Grids," Discrete Applied Math., vol. 63, pp. 7589, 1995.
[22] J. Storer, "On Minimal NodeCost Planar Embeddings," Networks, vol. 14, pp. 181212, 1984.
[23] R. Tamassia and I.G. Tollis, "Planar Grid Embeddings in Linear Time," IEEE Trans. Circuits and Systems, vol. 36, pp. 1,2301,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. 3540, 1991.
[25] L. Valiant, "Universality Considerations in VLSI Circuits," IEEE Trans. Computers, vol. 30, no 2, pp. 135140, Feb. 1981.