New results on drawing angle graphs

Computational Geometry: Theory and Applications

Volumn 9, Issue 1-2, 1998, Pages 43-82

  Garg, Ashim ^a  

^a State University of New York   (United States)

Author keywords

Angle; Constraints; Graph drawing; Layout; Resolution area; Series parallel graphs

Indexed keywords

EID: 0010773924     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00016-3     Document Type: Article

References (41)

1. C. Batini, M. Talamo, R. Tamassia, Computer aided layout of entity-relationship diagrams, J. Systems Software 4 (1984) 163-173.
2. P. Bertolazzi, R.F. Cohen, G. Di Battista, R. Tamassia, I.G. Tollis, How to draw a series-paralled digraph, Internat. J. Comput. Geom. Appl. 4 (1994) 385-402.
3. S.N. Bhatt, F.T. Leighton, A framework for solving VLSI graph layout problems, J. Comput. Syst. Sci. 28 (1984) 300-343.
4. T. Biedl, G. Kant, A better heuristic for orthogonal graph drawings, in: Proc. 2nd Annu. European Sympos. Algorithms (ESA '94), Lecture Notes in Computer Science 855, Springer, New York, 1994, pp. 24-35.
5. K. Booth, G. Lueker, Testing for the consecutive ones property interval graphs and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci. 13 (1976) 335-379.
6. N. Chiba, T. Yamanouchi, T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in: J.A. Bondy, U.S.R. Murty (Eds.), Progress in Graph Theory, Academic Press, New York, 1984, pp. 153-173.
7. M. Chrobak, T.H. Payne, A linear time algorithm for drawing a planar graph on a grid, Technical Report UCR-CS-90-2, Dept. of Math, and Comput. Sci., University of California, Riverside, 1990.
8. I.F. Cruz, A. Garg, Drawing graphs by example efficiently: Trees and planar acyclic digraphs, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894, Springer, New York, 1995, pp. 404-415.
9. I.F. Cruz, R. Tamassia, P. Van Hentenryk, A visual approach to graph drawing, in: Graph Drawing '93, Proc. ALCOM Workshop on Graph Drawing, Paris, France, September 1993.
10. H. De Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1) (1990) 41-51.
11. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications 4 (5) (1994) 235-282.
12. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu, An experimental comparison of four graph drawing algorithms, Computational Geometry: Theory and Applications 7 (5-6) (1997) 303-325.
13. G. Di Battista, R. Tamassia, I.G. Tollis, Area requirement and symmetry display of planar upward drawings, Discrete Comput. Geom. 7 (1992) 381-401.
14. G. Di Battista, L. Vismara, Angles of planar triangular graphs, in: Proc. 25th Annu. ACM Sympos. Theory Comput. (STOC '93), 1993, pp. 431-437.
15. D. Dolev, FT. Leighton, H. Trickey, Planar embedding of planar graphs, in: F.P. Preparata (Ed.), Advances in Computing Research, Vol. 2, JAI Press, Greenwich, CT, 1985, pp. 147-161.
16. P. Eades, T. Lin, Algorithmic and declarative approaches to aesthetic layout, in: Graph Drawing '93, Proc. ALCOM Workshop on Graph Drawing, Paris, France, September 1993.
17. M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Simvonis, E. Welzl, G. Woeginger, Drawing graphs in the plane with high resolution, SIAM J. Comput. 22 (1993) 1035-1052.
18. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
19. A. Garg, M.T. Goodricht, R. Tamassia, Area-efficient upward tree drawings, in: Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 359-368.
20. A. Garg, R. Tamassia, Planar drawings and angular resolution: Algorithms and bounds, in: Proc. 2nd Annu. European Sympos. Algorithms (ESA '94), Lecture Notes in Computer Science 855, Springer, New York, 1994, pp. 12-23.
21. A. Garg, R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, in: S.C. North (Ed.), Graph Drawing, Proc. GD '96, Lecture Notes in Computer Science, Springer, New York, 1997.
22. M. Himsolt, Comparing and evaluating layout algorithms within graphed, manuscript, Fakultät für Mathematik und Informatik, University Passau, 1994.
23. M. Himsolt, Comparing and evaluating layout algorithms within GraphEd, J. Visual Languages and Computing 6 (3) (special issue on Graph Visualization), 1995.
24. J. Hopcroft, R.E. Tarjan, Efficient planarity testing, J. ACM 21 (4) (1974) 549-568.
25. T. Kamada, On visualization of abstract objects and relations, Ph.D. Thesis, Department of Information Science, University of Tokyo, 1988.
26. G. Kant, Drawing planar graphs using the Imc-ordering, in: Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci., 1992, pp. 101-110.
27. G. Kant, Algorithms for drawing planar graphs, Ph.D. Thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands, 1993.
28. G. Kant, Hexagonal grid drawings, in: Proc 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., 1992.
29. C.E. Leiserson, Area-efficient graph layouts (for VLSI), in: Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci., 1980, pp. 270-281.
30. R. Liggett, E. Mitchell, Optimal space planning in practice, Computer Aided Design 13 (1981) 277-288.
31. S. Malitz, A. Papakostas, On the angular resolution of planar graphs, SIAM J. Discrete Math. 7 (1994) 172-183.
32. A. Papakostas, I.G. Tollis, Improved algorithms and bounds for orthogonal drawings, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing, Proc. GD '94, Lecture Notes in Computer Science 894, Springer, New York, 1995, pp. 40-51.
33. W. Schnyder, Embedding planar graphs on the grid, in: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 1990, pp. 138-148.
34. J.A. Storer, On minimal node-cost planar embeddings, Networks 14 (1984) 181-212.
35. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (3) (1987) 421-444.
36. R. Tamassia, A dynamic data structure for planar graph embedding, in: T. Lepisto, A. Salomaa (Eds.), Automata, Languages and Programming, Proc. 15th ICALP, Lecture Notes in Computer Science 317, Springer, New York, 1988, pp. 576-590.
37. R. Tamassia, I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (4) (1986) 321-341.
38. L. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput. 30 (2) (1981) 135-140.
39. G. Vijayan, Geometry of planar graphs with angles, in: Proc. 2nd Annu. ACM Sympos. Comput. Geom., 1986, pp. 116-124.
40. G. Vijayan, A. Wigderson, Rectilinear graphs and their embeddings, SIAM J. Comput. 14 (1985) 355-372.
41. D. Woods, Drawing planar graphs, Ph.D. Thesis, Department of Computer Science, Stanford University, 1982; also: Technical Report STAN-CS-82-943.