This Article 
 Bibliographic References 
 Add to: 
Computing Orthogonal Drawings with the Minimum Number of Bends
August 2000 (vol. 49 no. 8)
pp. 826-840

Abstract—We describe a branch-and-bound algorithm for computing an orthogonal grid drawing with the minimum number of bends of a biconnected planar graph. Such an algorithm is based on an efficient enumeration schema of the embeddings of a planar graph and on several new methods for computing lower bounds of the number of bends. We experiment with such algorithm on a large test suite and compare the results with the state-of-the-art. The experiments show the feasibility of the approach and also its limitations. Further, the experiments show how minimizing the number of bends has positive effects on other quality measures of the effectiveness of the drawing. We also present a new method for dealing with vertices of degree larger than four.

[1] C. Batini, E. Nardelli, and R. Tamassia, “A Layout Algorithm for Data Flow Diagrams,” IEEE Trans. Software Eng., vol. 12, no. 4, pp. 538-546, 1986.
[2] T. Biedl and G. Kant, "A Better Heuristic for Orthogonal Graph Drawings," Proc. Second Ann. European Symp. Algorithms (ESA '94), pp. 24-35, 1994.
[3] F.J. Brandenburg, M. Himsolt, and C. Rohrer, “An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms,” Graph Drawing (Proc. GD '95), F.J. Brandenburg, ed., pp. 76-87, 1996.
[4] G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing. Upper Saddle River, N.J.: Prentice Hall, 1999.
[5] G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu, "An Experimental Comparison of Four Graph Drawing Algorithms," Computational Geometry, vol. 7, nos. 5/6, pp. 303-325, 1997.
[6] G. Di Battista, G. Liotta, and F. Vargiu, “Spirality and Optimal Orthogonal Drawings,” SIAM J. Computers, vol. 27, no. 6, pp. 1,764-1,811, 1998.
[7] G. Di Battista and R. Tamassia, “On-Line Maintenance of Triconnected Components with SPQR-Trees,” Algorithmica, vol. 15, pp. 302-318, 1996.
[8] G. Di Battista and R. Tamassia, “On-Line Planarity Testing,” SIAM J. Computers, vol. 25, pp. 956-997, 1996.
[9] W. Didimo and G. Liotta, “Computing Orthogonal Drawings in a Variable Embedding Setting,” Algorithms and Computation (Proc. ISAAC '98), K. Chwa, ed., pp. 79-88, 1998.
[10] S. Even,Graph Algorithms. Pitman Publishing, 1979.
[11] S. Even and G. Granot, “Grid Layouts of Block Diagrams—Bounding the Number of Bends in Each Connection,” Graph Drawing (Proc. GD '94), R. Tamassia and I.G. Tollis, eds., pp. 64-75, 1995.
[12] U. Fößmeier and M. Kaufmann, “Drawing High Degree Graphs with Low Bend Numbers,” Graph Drawing (Proc. GD '95), F.J. Brandenburg, ed., pp. 254-266, 1996.
[13] A. Garg and R. Tamassia, “On the Computational Complexity of Upward and Rectilinear Planarity Testing,” Report CS-94-10, Computer Science Dept., Brown Univ. , Providence, R.I., 1994.
[14] A. Garg and R. Tamassia, “On the Computational Complexity of Upward and Rectilinear Planarity Testing,” Submitted to SIAM J. Computing, 1995.
[15] A. Garg and R. Tamassia, "A New Minimum Cost Flow Algorithm with Applications to Graph Drawing," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 201-216, 1996.
[16] M. Himsolt, “Comparing and Evaluating Layout Algorithms within GraphEd,” J. Visual Language and Computing, vol. 6, no. 3, pp. 255-273, 1995.
[17] J. Hopcroft and R.E. Tarjan, “Dividing a Graph into Triconnected Components,” SIAM J. Computing, vol. 2, no. 3, pp. 135-158, 1973.
[18] S. Jones, P. Eades, A. Moran, N. Ward, G. Delott, and R. Tamassia, “A Note on Planar Graph Drawing Algorithms,” Technical Report 216, Dept. of Computer Science, Univ. of Queensland, 1991.
[19] M. Jünger and P. Mutzel, “Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization,” Graph Drawing (Proc. GD '95), F.J. Brandenburg, ed., pp. 337-348, 1996.
[20] Y. Liu, A. Morgana, and B. Simeone, “General Theoretical Results on Rectilinear Embeddability of Graphs,” Acta Math. Applications Sinica, vol. 7, pp. 187-192, 1991.
[21] K. Mehlhorn and S. Näher, “LEDA: A Platform for Combinatorial and Geometric Computing,” Comm. ACM, vol. 38, no. 1, pp. 96-102, 1995.
[22] T. Nishizeki and N. Chiba, “Planar Graphs: Theory and Algorithms,” Ann. Discrete Math., vol. 32, 1988.
[23] A. Papakostas and I.G. Tollis, "Algorithms for Area-Efficient Orthogonal Drawings," Computational Geometry Theory and Applications, vol. 9, pp. 83-110, 1998.
[24] J.M. Six, K.G. Kakoulis, and I.G. Tollis, “Refinement of Orthogonal Graph Drawings,” Graph Drawing (Proc. GD '98), S. Whitesides, ed., pp. 302-315, 1999.
[25] R. Tamassia, “On Embedding a Graph in the Grid with the Minimum Number of Bends,” SIAM J. Computing, vol. 16, no. 3, pp. 421-444, 1987.
[26] R. Tamassia, G. Di Battista, and C. Batini, “Automatic Graph Drawing and Readability of Diagrams,” IEEE Trans. Systems, Man, and Cybernetics, vol. 18, no. 1, pp. 61-79, 1988.
[27] R. Tamassia and I.G. Tollis, “A Unified Approach to Visibility Representations of Planar Graphs,” Discrete Computational Geometry, vol. 1, no. 4, pp. 321-341, 1986.
[28] R. Tamassia and I.G. Tollis, “Efficient Embedding of Planar Graphs in Linear Time,” Proc. IEEE Int'l Symp. Circuits and Systems, pp. 495-498, 1987.

Index Terms:
Orthogonal drawings, bends, planar embedding, branch and bound, graph drawing, planar graphs.
Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo, "Computing Orthogonal Drawings with the Minimum Number of Bends," IEEE Transactions on Computers, vol. 49, no. 8, pp. 826-840, Aug. 2000, doi:10.1109/12.868028
Usage of this product signifies your acceptance of the Terms of Use.