Efficient orthogonal drawings of high degree graphs

Algorithmica (New York)

Volumn 26, Issue 1, 2000, Pages 100-125

  Papakostas, A ^a   Tollis, I G ^b  

^a NEC America   (United States)

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

Author keywords

Algorithms; Graph drawing; Graphical user interfaces; Information visualization; Orthogonal graph drawing

Indexed keywords

EID: 0009986301     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910006     Document Type: Article

References (22)

1. T. Biedl, Drawing High-Degree Graphs with Small Grid-Size, Tech. Report RRR 37-96, RUTCOR, Rutgers University, November 1996.
2. T. Biedl, Personal communication, December 1996.
3. 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, Springer-Verlag, Berlin, 1994, pp. 24-35.
4. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
5. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. Theory Appl., 4(5) (1994), 235-282. Also available via anonymous ftp from ftp. cs. brown. edu, gdbiblio. tex. Z and gdbiblio. ps. Z in /pub/papers/compgeo.
6. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Proc. ACM Symp. on Computational Geometry, 1995, pp. 306-315. The version of the paper with the four algorithms can be obtained from http://www.cs.brown/people/rt.
7. P. F. Dietz and D. D. Sleator, Two algorithms for maintaining order in a list, Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, pp. 365-372.
8. S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, Comput. Science Dept., Technion, Israel Institute of Technology, 1994.
9. S. Even and G. Granot, Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection, Proc. DIMACS Workshop GD '94, Lecture Notes in Computer Science, vol. 894, Springer-Verlag, Berlin, 1994, pp. 64-75.
10. S. Even and R. E. Tarjan, Computing an st-numbering, Theoret. Comput. Sci., 2 (1976), 339-344.
11. U. Fößmeier and M. Kaufmann, Drawing High Degree Graphs with Low Bend Numbers, Proc. Workshop GD '95, Lecture Notes in Computer Science, vol. 1027, Springer-Verlag, Berlin, 1995, pp. 254-266.
12. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16(1) (1996), 4-32.
13. A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, Computer Science Dept., The University of Texas at Dallas, November 1996.
14. A. Papakostas and I. G. Tollis, Algorithms for area-efficient orthogonal drawings, Comput. Geom. Theory Appl., 9 (1998), 83-110.
15. A. Papakostas and I. G. Tollis, A Pairing Technique for Area-Efficient Orthogonal Drawings, Proc. Workshop GD '96, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, Berlin, 1996, pp. 355-370.
16. A. Papakostas and I. G. Tollis, Interactive orthogonal graph drawing, IEEE Trans. Comput., 47(11) (1998), 1297-1309.
17. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom., 1 (1986), 343-353.
18. M. Schäffter, Drawing graphs on rectangular grids, Discrete Appl. Math., 63 (1995), 75-89.
19. J. Storer, On minimal node-cost planar embeddings, Nehvorks, 14 (1984), 181-212.
20. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16 (1987), 421-444.
21. R. Tamassia and I. G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom., 1 (1986), 321-341.
22. R. Tamassia and I. Tollis, Planar grid embeddings in linear time, IEEE Trans. Circuits and Systems, 36 (1989), 1230-1234.