Orthogonal drawing of high degree graphs with small area and few bends

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

Volumn 1272, Issue , 1997, Pages 354-367

  Papakostas, Achilleas ^a   Tollis, Ioannis G ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

DEGREE GRAPHS; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS; RECTANGULAR BOX; SMALL AREA;

DATA STRUCTURES;

EID: 0348194484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_74     Document Type: Conference Paper

References (20)

1. C. Batini, E. Nardelli, and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans, on Software Engineering SE-12(4) (1986), pp. 538-546.
2. T. Biedl, Orthogonal Graph Visualization: The Three-Phase Method With Applications, Ph.D. Thesis, RUTCOR, Rutgers University, May 1997.
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, pp. 24-35, Springer-Verlag, 1994.
4. G. Di Battista, P. 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. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Proc. of ACM Symp. on Computational Geometry, 1995, pp. 306-315. The version of the paper with the four algorithms can be obtained from http://www.es.brown/people/rt.
6. 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 Comp. Sci. 894, Springer-Verlag, 1994, pp. 64-75.
7. S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339-344.
8. U. Foessmaier and M. Kaufmann, Drawing High Degree Graphs with Low Bend Numbers, Proc. Symposium on Graph Drawing (GD ’95), Lecture Notes in Comp. Sci. 1027, Springer-Verlag, Sept. 1995, pp. 254-266.
9. Goos Kant, Drawing Planar Graphs Using the Canonical Ordering, Algorithmica, vol. 16, no. 1, 1996, pp. 4-32.
10. A. Lempel, S. Even and I. Cederbaum, An algorithm for planarity testing in graphs, Theory of Graphs, 215-232, Gordon and Breach, New York, 1967.
11. J. Pach and G. Toth, Graphs Drawn with Few Crossings per Edge, Proc. of Symposium on Graph Drawing (GD’96), Lecture Notes in Comp. Sci. 1190, Springer-Verlag, pp. 345-354.
12. A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, Comp. Science Dept., The University of Texas at Dallas, November 1996.
13. A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Technical Report UTDCS-06-95, The University of Texas at Dallas, 1995.
14. A. Papakostas and I. G. Tollis, Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends, Technical Report UTDCS-04-96, The University of Texas at Dallas, 1996.
15. A. Papakostas and I. G. Tollis, A Pairing Technique for Area-Efficient Orthogonal Drawings, Proc. of Symposium on Graph Drawing (GD’96), Lecture Notes in Comp. Sci. 1190, Springer-Verlag, pp. 355-370.
16. A. Papakostas, J.M. Six, and I. G. Tollis, Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing, Proc. of Symposium on Graph Drawing (GD’96), Lecture Notes in Comp. Sci. 1190, Springer-Verlag, pp. 371-386.
17. M. Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. 63 (1995), pp. 75-89.
18. J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181-212.
19. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Computing 16 (1987), pp. 421-444.
20. R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans, on Circuits and Systems CAS-36 (1989), pp. 1230-1234.