Turn-regularity and optimal area drawings of orthogonal representations

Computational Geometry: Theory and Applications

Volumn 16, Issue 1, 2000, Pages 53-93

  Bridgeman, Stina S ^a   Di Battista, Giuseppe ^b   Didimo, Walter ^b   Liotta, Giuseppe ^c   Tamassia, Roberto ^a   Vismara, Luca ^a  

^a Brown Univerity   (United States)

^b ROMA TRE UNIVERSITY   (Italy)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005280491     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00054-1     Document Type: Article

References (34)

1. P. Bertolazzi, G. Di Battista, W. Didimo, Computing orthogonal drawings with the minimum number of bends, in: F. Dehne, A. Rau-Chaplin, J.-R. Sack and R. Tamassia (Eds.), Algorithms and Data Structures (Proc. WADS '97), Lecture Notes in Computer Science, Vol. 1272, Springer, 1997, pp. 331-344.
2. P. Bertolazzi, G. Di Battista, G. Liotta, C. Mannino, Upward drawings of triconnected digraphs, Algorithmica 6 (12) (1994) 476-497.
3. T.C. Biedl, New lower bounds for orthogonal graph drawings, in: F.J. Brandenburg (Ed.), Graph Drawing (Proc. GD '95), Lecture Notes in Computer Science, Vol. 1027, Springer, 1996, pp. 28-39.
4. T.C. Biedl, G. Kant, A better heuristic for orthogonal graph drawings, Computational Geometry 9 (3) (1998) 159-180.
5. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London, UK, 1976.
6. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing, Prentice-Hall, Upper Saddle River, NJ, 1999.
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu, An experimental comparison of four graph drawing algorithms, Computational Geometry 7 (5-6) (1997) 303-325.
8. G. Di Battista, G. Liotta, Upward planarity checking: "Faces are more than polygons", in: S.H. Whitesides (Ed.), Graph Drawing (Proc. GD '98), Lecture Notes in Computer Science, Vol. 1547, Springer, 1998, pp. 72-86.
9. G. Di Battista, G. Liotta, F. Vargiu, Spirality and optimal orthogonal drawings, SIAM J. Comput. 27 (6) (1998) 1764-1811.
10. G. Di Battista, R. Tamassia, Algorithms for plane representations of acyclic digraphs, Theoret. Comput. Sci. 61 (2,3) (1988) 175-198.
11. W. Didimo, G. Liotta, Computing orthogonal drawings in a variable embedding setting, in: K.-Y. Chwa and O.H. Ibarra (Eds.), Algorithms and Computation (Proc. ISAAC '98), Lecture Notes in Computer Science, Vol. 1533, Springer, 1998, pp. 79-88.
12. U. Fößmeier, C. Hess, M. Kaufmann, On improving orthogonal drawings: The 4M-algorithm, in: S.H. Whitesides (Ed.), Graph Drawing (Proc. GD '98), Lecture Notes in Computer Science, Vol. 1547, Springer, 1998, pp. 125-137.
13. U. Fößmeier, M. Kaufmann, Drawing high degree graphs with low bend numbers, in: F.J. Brandenburg (Ed.), Graph Drawing (Proc. GD '95), Lecture Notes in Computer Science, Vol. 1027, Springer, 1996, pp. 254-266.
14. A. Garg, R. Tamassia, Planar drawings and angular resolutions: Algorithms and bounds, in: J. van Leeuwen (Ed.), Algorithms (Proc. ESA '94), Lecture Notes in Computer Science, Vol. 855, Springer, 1994, pp. 12-23.
15. A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science, Vol. 894, Springer, 1995, pp. 286-297.
16. A. Garg, R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, in: S. North, (Ed.), Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science, Vol. 1190, Springer, 1997, pp. 201-216.
17. N. Gelfand, R. Tamassia, Algorithmic patterns for orthogonal graph drawing, in: S.H. Whitesides (Ed.), Graph Drawing (Proc. GD '98), Lecture Notes in Computer Science, Vol. 1547, Springer, 1998, pp. 138-152.
18. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
19. F. Hoffmann, K. Kriegel, Embedding rectilinear graphs in linear time, Inform. Process. Lett. 29 (2) (1988) 75-79.
20. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
21. M.Y. Hsueh, Symbolic layout and compaction of integrated circuits, Ph.D. Thesis, University of California, Berkeley, CA, 1980.
22. M.Y. Hsueh, D.O. Pederson, Computer-aided layout of LSI circuit building-blocks, in: Proc. IEEE Internat. Symp. Circuits and Systems, 1979.
23. G.W. Klau, P. Mutzel, Optimal compaction of orthogonal grid drawings, in: G. Cornuejols, R.E. Burkard, G.J. Woeginger (Eds.), Integer Programming and Combinatorial Optimization (Proc. IPCO '99), Lecture Notes in Computer Science, Vol. 1610, Springer, 1999, pp. 304-319.
24. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, B.G. Teubner/Wiley, Stuttgart, Germany/ Chichester, England, 1990.
25. R.H.J.M. Otten, J.G. van Wijk, Graph representations in interactive layout design, in: Proc. IEEE Internat. Sympos. Circuits and Systems, 1978, pp. 914-918.
26. A. Papakostas, I.G. Tollis, Algorithms for area-efficient orthogonal drawings, Computational Geometry 9 (1-2) (1998) 83-110.
27. M. Patrignani, On the complexity of orthogonal compaction, in: F. Dehne, A. Gupta, J.-R. Sack, R. Tamassia (Eds.), Algorithms and Data Structures (Proc. WADS '99), Lecture Notes in Computer Science, Vol. 1663, Springer, 1999, pp. 56-61.
28. J.M. Six, K.G. Kakoulis, I.G. Tollis, Refinement of orthogonal graph drawings, in: S.H. Whitesides (Ed.), Graph Drawing (Proc. GD '98), Lecture Notes in Computer Science, Vol. 1547, Springer, 1998, pp. 302-315.
29. L. Stockmeyer, Optimal orientation of cells in slicing floorplan design, Inform. Control 57 (2/3) (1983) 91-101.
30. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (3) (1987) 421-444.
31. R. Tamassia, I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits Syst. 36 (9) (1989) 1230-1234.
32. R. Tamassia, I.G. Tollis, J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inform. Process. Lett. 39 (1) (1991) 35-40.
33. G. Vijayan, A. Wigderson, Rectilinear graphs and their embeddings, SIAM J. Comput. 14 (2) (1985) 355-372.
34. W. Wimer, I. Koren, I. Cederbaum, Floorplans, planar graphs and layouts, IEEE Trans. Circuits Syst. 35 (3) (1988) 267-278.