Issues in interactive orthogonal graph drawing (Preliminary version)

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

Volumn 1027, Issue , 1996, Pages 419-430

  Papakostas, Achilleas ^a   Tollis, Ioannis G ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DESIGN PROCESS; DESIGN PROGRESS; DRAWING SYSTEM; GRAPH DRAWING; HUMAN INTERACTIONS; MAXIMUM DEGREE; ORTHOGONAL GRAPHS;

DRAWING (GRAPHICS);

EID: 84947912788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021825     Document Type: Conference Paper

References (21)

1. Theiese 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. 2nd Ann. European Symposium on Algorithms (ESA'94), Lecture Notes in Computer Science, vol. 855, pp. 24-35, Springer-Verlag, 1994.
3. R. Cohen, G. DiBattista, R. Tamassia, and I. G. Tollis, Dynamic Graph Drawing, to appear in SIAM Journal on Computing.
4. G. DiBattista, R Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 5, 1994, pp. 235-282. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.
5. G. DiBattista, G. Liotta and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, SpringerVerlag, 1993, pp. 151-162.
6. S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, Comp. Science Dept., Technion, Israel Inst, of Tech., 1994.
7. S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sei. 2 (1976), pp. 339-344.
8. A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Proc. DIMACS Workshop GD'94, Lecture Notes in Comp. Sei. 894, Springer-Verlag, 1994, pp. 286-297.
9. Goos Kant, Drawing planar graphs using the Imc-ordering, Proc. 33th Ann. IEEE Symp. on Found, of Comp. Science, 1992, pp. 101-110.
10. F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found, of Comp. Science, 1981, pp. 1-12.
11. Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Symp. on Found, of Comp. Science, 1980, pp. 270-281.
12. Thomas 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. Workshop on Computer-Aided Software Engineering (Case'93), 1993.
14. A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, journal version, in preparation.
15. A. Papakostas and I. G. Tollis, Improved Algorithms and Bounds for Orthogonal Drawings, Proc. DIMACS Workshop GD'94, Lecture Notes in Comp. Sei. 894, Springer-Verlag, 1994, pp. 40-51.
16. Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math, (to appear).
17. J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181-212.
18. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421-444.
19. R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans, on Circuits and Systems CAS-36 (1989), pp. 1230-1234.
20. R. Tamassia, I. Tollis and J. Vitter, Lower Bounds for Planar Orthogonal Drawings of Graphs, Information Processing Letters 39 (1991), pp. 35-40.
21. L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans, on Comp., vol. C-30, no 2, (1981), pp. 135-140.