Algorithms for area-efficient orthogonal drawings

Computational Geometry: Theory and Applications

Volumn 9, Issue 1-2, 1998, Pages 83-110

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

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

^b NEC America   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039346903     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00017-5     Document Type: Article

References (24)

1. T. Biedl, Embedding nonplanar graphs in the rectangular grid, Rutcor Research Report 27-93, 1993.
2. T. Biedl, New lower bounds for orthogonal graph drawings, in: Proc. of Workshop GD '95, Lecture Notes in Computer Science 1027, Springer, New York, 1995, pp. 28-39.
3. T. Biedl, Improved orthogonal drawings of 3-graphs, in: Proc. of CCCG '96, Carleton University Press, 1996.
4. T. Biedl, G. Kant, A better heuristic for orthogonal graph drawings, Technical Report UU-CS-1995-04, Dept. of Comp. Sci., Utrecht University, 1995. Preliminary version appeared in Proc. 2nd Annu. European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science 855, Springer, New York, 1994, pp. 24-35.
5. T. Biedl, G. Kant, A better heuristic for orthogonal graph drawings, Technical Report UU-CS-1995-04, Dept. of Comp. Sci., Utrecht University, 1995. Preliminary version appeared in Proc. 2nd Annu. European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science 855, Springer, New York, 1994, pp. 24-35.
6. T. Calamoneri, R. Petreschi, An efficient orthogonal grid drawing algorithm for cubic graphs, in: Proc. of COCOON '95, Lecture Notes in Computer Science 959, 1995, pp. 31-40.
7. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications 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.
8. G. Di Battista, G. Liotta, F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, in: Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer, New York, 1993, pp. 151-162.
9. P.F. Dietz, D.D. Sleator, Two algorithms for maintaining order in a list, in: Proc. 19th Annu. ACM Symp. Theory of Computing, 1987, pp. 365-372.
10. S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
11. S. Even, G. Granot, Rectilinear planar drawings with few bends in each edge, Technical Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994.
12. S. Even, R.E. Tarjan, Computing an st-numbering, Theor. Comput. Sci. 2 (1976) 339-344.
13. A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, in: Proc. DIMACS Workshop GD '94, Lecture Notes in Computer Science 894, Springer, New York, 1994, pp. 286-297.
14. G. Kant, Drawing planar graphs using the lmc-ordering, in: Proc. 33rd Annu. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101-110.
15. F.T. Leighton, New lower bound techniques for VLSI, in: Proc. 22nd Annu. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1-12.
16. C.E. Leiserson, Area-efficient graph layouts (for VLSI), in: Proc. 21st Annu. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270-281.
17. A. Papakostas, I.G. Tollis, Improved algorithms and bounds for orthogonal drawings, in: Proc. DIMACS Workshop GD '94, Lecture Notes in Computer Science 894, Springer, New York, 1994, pp. 40-51.
18. A. Papakostas, I.G. Tollis, Issues in interactive orthogonal graph drawing, in: Proc. of Workshop GD '95, Lecture Notes in Computer Science 1027, Springer, New York, 1995, pp. 419-430.
19. M. Schäffter, Drawing graphs on rectangular grids, Discrete Appl. Math. 63 (1995) 75-89.
20. J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984) 181-212.
21. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987) 421-444.
22. R. Tamassia, I. Tollis, Planar grid embeddings in linear time, IEEE Trans. Circuits and Systems 36 (1989) 1230-1234.
23. R. Tamassia, I. Tollis, J. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inform. Process. Lett. 39 (1991) 35-40.
24. L. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput. 30 (2) (1981) 135-140.