Computing orthogonal drawings with the minimum number of bends

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

Volumn 1272, Issue , 1997, Pages 331-344

  Bertolazzi, Paola ^a   Di Battista, Giuseppe ^b   Didimo, Walter ^b  

^a CNR   (Italy)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; GRAPH THEORY; GRAPHIC METHODS;

BRANCH-AND-BOUND ALGORITHMS; GRAPHIC TOOL; LOWER BOUNDS; MINIMIZING THE NUMBER OF; ORTHOGONAL DRAWINGS; ORTHOGONAL GRID DRAWINGS; QUALITY MEASURES; STATE OF THE ART;

DATA STRUCTURES;

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

References (23)

1. T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In Proc. 2nd Annu. European Sympos. Algorithms (ESA ’94), volume 855 of Lecture Notes in Computer Science, pages 24-35. Springer-Verlag, 1994.
2. F. J. Brandenburg, editor. Graph Drawing (Proc. GD ’95), volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
3. F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD ’95), volume 1027 of Lecture Notes in Computer Science, pages 76-87. Springer-Verlag, 1996.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput Geom. Theory Appl., 4:235-282, 1994.
5. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 306-315, 1995.
6. G. Di Battista, G. Liotta, and F. Vargiu. Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs. In Proc. Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 151-162. Springer-Verlag, 1993.
7. G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-tree s. Algorithmica, 15:302-318, 1996. Preprint: Technical Report CS-92-40, Comput. Sci. Dept., Brown Univ. (1992).
8. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., to appear. Preprint: Technical Report CS-92-39, Comput. Sci. Dept., Brown Univ. (1992).
9. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
10. A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Report CS-94-10, Comput. Sci. Dept., Brown Univ., Providence, RI, 1994.
11. A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Submitted to SIAM Journal on Computing, 1995.
12. M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. J. Visual Lang. Comput., 6(3), 1995. (special issue on Graph Visualization, edited by I. F. Cruz and P. Eades).
13. J. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2:135-158, 1973.
14. S. Jones, P. Eades, A. Moran, N. Ward, G. Delott, and R. Tamassia. A note on planar graph drawing algorithms. Technical Report 216, Department of Computer Science, University of Queensland, 1991.
15. M. Jünger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD ’95), volume 1027 of Lecture Notes in Computer Science, pages 337-348. Springer-Verlag, 1996.
16. K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96-102, 1995.
17. T. Nishizeki and N. Chiba. Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988.
18. A. Papakostas and I. G. Tollis. Improved algorithms and bounds for orthogonal drawings. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD ’94), volume 894 of Lecture Notes in Computer Science, pages 40-51. Springer-Verlag, 1995.
19. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.
20. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybem., SMC-18(1):61-79, 1988.
21. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom, 1(4):321-341, 1986.
22. R. Tamassia and I. G. Tollis. Efficient embedding of planar graphs in linear time. In Proc. IEEE Intemat. Sympos. on Circuits and Systems, pages 495-498, 1987.
23. R. Tamassia and I. G. Tollis, editors. Graph Drawing (Proc. GD ’94), volume 894 of Lecture Notes in Computer Science. Springer-Verlag, 1995.