Spirality and optimal orthogonal drawings

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1764-1811

  Di Battista, Giuseppe ^a   Liotta, Giuseppe ^b   Vargiu, Francesco ^c  

^a ROMA TRE UNIVERSITY   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c Autorità per l Informatica nella Pubblica Amministrazione   (Italy)

Author keywords

Bend minimization; Graph drawing; Orthogonal representation; Planar embedding

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIALS;

ORTHOGONAL DRAWING;

GRAPH THEORY;

EID: 0032312476     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794262847     Document Type: Article

References (31)

1. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. P. BERTOLAZZI, R. F. COHEN, G. DI BATTISTA, R. TAMASSIA, AND I. G. TOLLIS, How to draw a series-parallel digraph, in Proc. 3rd Scandinavian Workshop on Algorithm Theory, 1992, pp. 272-283;
3. Internat. J. Comput. Geom. Appl., 4 (1994), pp. 385-402.
4. T. BIEDL AND G. KANT, A better heuristic for orthogonal graph drawings, in Algorithms - ESA'94, Second Annual European Symposium, Utrecht, 1994, J. van Leeuwen, ed., Lecture Notes in Comput. Sci. 855, Springer-Verlag, New York, 1994, pp. 24-35.
5. G. DI BATTISTA, G. LIOTTA, AND F. VARGIU, Spirality and Optimal Orthogonal Drawings, Tech. Report 07.94, Dipartimento di Informatica e Sistemistica, Universita' di Roma "La Sapienza," 1994.
6. G. DI BATTISTA AND R. TAMASSIA, Incremental planarity testing, in Proc. 30th IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1989, pp. 436-441.
7. G. DI BATTISTA AND R. TAMASSIA, On Line Planarity Testing, Tech. Report CS-89-31, Dept. of Computer Science, Brown Univ., Providence, RI, 1989.
8. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Algorithms for automatic graph Drawing: An annotated bibliography, Comput. Geom. Theory Appl., 4 (1994), pp. 235-282.
9. S. EVEN, Graph Algorithms, Computer Science Press, Potomac, MD, 1979.
10. H. EVERETT AND D. G. CORNEIL, Recognizing visibility graphs of spiral polygons, J. Algorithms, 11 (1990), pp. 1-26.
11. D. R. FULKERSON, An out-of-kilter method for minimal cost flow problems, SIAM J. Appl. Math., 9 (1961), pp. 18-27.
12. A. GARG AND R. TAMASSIA, On the computational complexity of upward and rectilinear planarity testing, in Graph Drawing, Dimacs Internat. Workshop, GD'94, Princeton, NJ, 1994, R. Tamassia and I. G. Tollis, eds., Lecture Notes in Comput. Sci. 894, Springer-Verlag, New York, 1994, pp. 286-297.
13. J. HOPCROFT AND R. E. TARJAN, Efficient planarity testing, J. Assoc. Comput. Mach., 21 (1974), pp. 549-568.
14. G. KANT, Drawing planar graphs using the canonical-ordering, in Proc. IEEE Symp. on Foundations of Computer Science, Pittsburgh, IEEE, Piscataway, NJ, 1992, pp. 101-110.
15. G. KANT, Algorithms for Drawing Planar Graphs, Ph.D. Thesis, Dept. Computer Science, Univ. of Utrecht, the Netherlands, 1993.
16. E. L. LAWLER, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
17. Y. LIU, A. MORGANA, AND B. SIMEONE, A Linear Algorithm for 3-Bend Embeddings of Planar Graphs in the Grid, manuscript, 1993.
18. T. NISHIZEKI AND N. CHIBA, Planar Graphs: Theory and Algorithms, Ann. Discrete Math. 32, North-Holland, Amsterdam, 1988.
19. A. PAPAKOSTAS AND I. G. TOLLIS, Improved algorithms and bounds for orthogonal drawings, in Graph Drawing, Dimacs Internat. Workshop, GD'94, Princeton, NJ, 1994, R. Tamassia and I. G. Tollis, eds., Lecture Notes in Comput. Sci. 894, Springer-Verlag, New York, 1994, pp. 40-51.
20. J. A. STORER, On minimal node-cost planar embeddings, Networks, 14 (1984), pp. 181-212.
21. K. TAKAMIZAWA, T. NISHIZEKI, AND N. SAITO, Linear-time computability of combinatorial problems on series-parallel graphs, J. Assoc. Comput. Mach., 29 (1982), pp. 623-641.
22. R. TAMASSIA, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16 (1987), pp. 421-444.
23. R. TAMASSIA, Planar orthogonal drawings of graphs, in Proc. IEEE Internat. Symp. on Circuits and Systems, IEEE, Piscataway, NJ, 1990, pp. 319-322.
24. R. TAMASSIA, G. DI BATTISTA, AND C. BATINI, Automatic graph drawing and readability of diagrams, IEEE Trans. Systems, Man Cybernet., SMC-18 (1988), pp. 61-79.
25. R. TAMASSIA AND I. G. TOLLIS, Efficient embedding of planar graphs in linear time, in Proc. IEEE Internat. Symp. on Circuits and Systems, Philadelphia, IEEE, Piscataway, NJ, 1987, pp. 495-498.
26. R. TAMASSIA AND I. G. TOLLIS, Planar grid embedding in linear time, IEEE Trans. Circuits Systems, CAS-36 (1989), pp. 1230-1234.
27. R. TAMASSIA, I. G. TOLLIS, AND J. S. VITTER, Lower bounds and parallel algorithms for planar orthogonal grid drawings, in Proc. IEEE Symp. on Parallel and Distributed Processing, IEEE, Piscataway, NJ, 1991, pp. 386-393.
28. R. TAMASSIA, I. G. TOLLIS, AND J. S. VITTER, Lower bounds for planar orthogonal drawings of graphs, Inform. Process. Lett., 39 (1991), pp. 35-40.
29. J. VALDES, R. E. TARJAN, AND E. L. LAWLER, The recognition of series parallel digraphs, SIAM J. Comput., 11 (1982), pp. 298-313.
30. L. VALIANT, Universality considerations in VLSI circuits, IEEE Trans. Computers, C-30 (1981), pp. 135-140.
31. G. VIJAYAN AND A. WIGDERSON, Rectilinear graphs and their embeddings, SIAM J. Comput., 14 (1985), pp. 355-372.