Refinement of orthogonal graph drawings

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

Volumn 1547, Issue , 1999, Pages 302-315

  Six, Janet M ^a   Kakoulis, Konstantinos G ^a   Tollis, Ioannis G ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957882286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_23     Document Type: Conference Paper

References (30)

1. T. Biedl and G. Kant, A Better Heuristic for Orthogonal Graph Drawings, Proc. ESA’94, LNCS 855, Springer-Verlag, 1994, pp. 24-35.
2. T. C. Biedl, B. P. Madden and I. G. Tollis, The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing, Proc. GD’97, LNCS 1353, Springer-Verlag, 1997, pp. 391-402.
3. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia and L. Vismara, Interactive Giotto: An Algorithm for Interactive Orthogonal Graph Drawing, Proc. GD’97, LNCS 1353, Springer-Verlag, 1997, pp. 303-308.
4. S. Bridgeman, A. Garg and R. Tamassia, A Graph Drawing and Translation Service on the WWW, Proc. GD’96, LNCS 1190, Springer-Verlag, 1997, pp. 45-52.
5. R. F. Cohen, G. Di Battista, R. Tamassia and I. G. Tollis, Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs, SIAM J. Computing, 24(5), October 1995, pp. 970-1001.
6. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, 4(5), 1994, pp. 235-282.
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, An Experimental Comparison of Four Graph Drawing Algorithms, Computational Geometry: Theory and Applications, 1997, pp. 303-325.
8. C. Ding and P. Mateti, A Framework for the Automated Drawing of Data Structure Diagrams, IEEE Transactions on Software Engineering, 16(5), 1990, pp. 543-557.
9. J. Doenhardt and T. Lengauer, Algorithmic Aspects of One Dimensional Layout Compaction, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6(5), 1987, pp. 863-879.
10. C. Esposito, Graph Graphics: Theory and Practice, Computers and Mathematics with Applications, 15(4), 1988, pp. 247-253.
11. S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, CS Dept., Technion, Israel Inst. of Tech., 1994.
12. Jody Fanto, Postprocessing of GIOTTO drawings, http://www.cs.brown.edu/ people/jrf/.
13. U. Fößmeier, Interactive Orthogonal Graph Drawing: Algorithms and Bounds, Proc. GD’97, LNCS 1353, Springer-Verlag, 1997, pp. 111-123.
14. U. Fößmeier and M. Kaufmann, Algorithms and Area Bounds for Nonplanar Orthogonal Drawings, Proc. GD’97, LNCS 1353, Springer-Verlag, 1997, pp. 134-145.
15. M. Y. Hsueh, Symbolic Layout and Compaction of Integrated Circuits, Ph.D. Thesis, University of California at Berkeley, Berkeley, CA, 1979.
16. G. Kant, Drawing Planar Graphs Using the lmc-ordering, Proc. 33rd Ann. IEEE Symposium on Found. of Comp. Sci., 1992, pp. 101-110.
17. C. Kosak, J. Marks and S. Shieber, Automating the Layout of Network Diagrams with Specified Visual Organization, IEEE Transactions on Systems, Man, Cybernetics, 24(3), 1994, pp. 440-454
18. Thomas Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.
19. 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, pp. 297-308.
20. 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.
21. A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, University of Texas at Dallas, 1996.
22. A. Papakostas, J. M. Six and I. G. Tollis, Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing, Proc. GD’96, LNCS 1190, Springer-Verlag, 1997, pp. 371-386.
23. A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Computational Geometry: Theory and Applications, 9(1998) 1998, pp. 83-110.
24. A. Papakostas and I. G. Tollis, Issues in Interactive Orthogonal Graph Drawing, Proc. GD’95, LNCS 1027, Springer-Verlag, 1995, pp. 419-430. Also available at http://www.utdallas.edu/∼tollis/papers.html.
25. H. Purchase, Which Aesthetic has the Greatest Effect on Human Understanding, Proc. of GD’97, LNCS 1353, Springer-Verlag, 1997, pp. 248-261.
26. M. Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math., 63(1995), pp. 75-89.
27. R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Comput., 16(1987), pp. 421-444.
28. R. Tamassia, G. Di Battista and C. Batini, Automatic Graph Drawing and Readability of Diagrams, IEEE Transactions on Systems, Man, and Cybernetics, 18(1), 1988, pp. 61-79.
29. R. Tamassia and I. G. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36, 1989, pp. 1230-1234.
30. I. G. Tollis, Graph Drawing and Information Visualization, ACM Computing Surveys, 28A(4), December 1996. Also available at http://www.utdallas.edu/¯∼tollis/SDCR96/TollisGeometry/.