Drawing Planar Graphs Using the Canonical Ordering

Algorithmica (New York)

Volumn 16, Issue 1, 1996, Pages 4-32

  Kant, G ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Canonical ordering; Convex; Graph drawing; Linear time; Orthogonal; Visibility representation

Indexed keywords

EID: 0002648128     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02086606     Document Type: Article

References (49)

1. Bhasker, J., and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988), 147-178.
2. Biedl, T., and G. Kant, A better heuristic for planar orthogonal drawings, in Proc. 2nd European Symp. on Algorithms (ESA '94), Lecture Notes in Computer Science, Vol. 855, Springer-Verlag, Berlin, 1994, pp. 24-36.
3. Booth, K. S., and G. S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity testing using PQ-tree algorithms, J. Comput. System Sci. 13 (1976), 335-379.
4. Chiba, N., T. Nishizeki, S. Abe, and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci. 30 (1985), 54-76.
5. Chiba, N., K. Onoguchi, and T. Nishizeki, Drawing planar graphs nicely, Acta Inform. 22 (1985), 187-201.
6. Chrobak, M., and G. Kant, Convex Grid Drawings of 3-Connected Planar Graphs, Tech. Rep. RUU-CS-93-45, Dept. of Computer Science, Utrecht University, 1993.
7. Chrobak, M., and T. H. Payne, A Linear Time Algorithm for Drawing Planar Graphs on the Grid, Tech. Rep. UCR-CS-90-2, Dept. of Mathematics and Computer Science, University of California at Riverside, 1990.
8. Cohen, R. F., G. Di Battista, R. Tamassia, I. G. Tollis, and P. Bertolazzi, A framework for dynamic graph drawing, in Proc. 8th Annual ACM Symp. on Computational Geometry, 1992, pp. 261-270.
9. 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), 235-282.
10. Di Battista, G., G. Liotta, and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, in Proc. Workshop on Algorithms and Data Structures (WADS '93), Lecture Notes in Computer Science, Vol. 709, Springer-Verlag, 1993, Berlin, pp. 151-162.
11. Di Battista, G., and R. Tamassia, Incremental planarity testing, in Proc. 30th Annual IEEE Symp. on Foundations of Computer Science (FOCS '89), 1989, pp. 436-441.
12. Di Battista, G., R. Tamassia, and I. G. Tollis, Area requirement and symmetry display in drawing graphs, Discrete Comput. Geom. 7 (1992), 381-401.
13. Di Battista, G., and L. Vismara, Angles of planar triangular graphs, extended abstract in Proc. 25th Annual ACM Symp. on Theory of Computing, 1993, pp. 431-437.
14. Even, S., and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Manuscript, Faculty of Computer Science, The Technion, Haifa, 1993.
15. Even, S., and R. E. Tarjan, Computing an st-numbering, Theoret. Comp. Sci. 2 (1976), 436-441.
16. Fáry, I., On straight line representations of planar graphs, Acta Sci. Math. Szeged, 11 (1948), 229-233.
17. Formann, M., T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger, Drawing graphs in the plane with high resolution, SIAM J. Comput. 22 (1993), 1035-1052.
18. Fraysseix, H. de, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), 41-51.
19. Garg, A., and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, in Proc. Graph Drawing '94, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994, to appear.
20. Garg, A., and R. Tamassia, Planar drawings and angular resolution: algorithms and bounds, in Proc. 2nd European Symp. on Algorithms (ESA '94), Lecture Notes in Computer Science, Vol. 855, Springer-Verlag, Berlin, 1994, pp. 12-23.
21. Haandel, F. van, Straight Line Embeddings on the Grid, M.Sc. Thesis, No. INF/SCR-91-19, Dept. of Computer Science, Utrecht University, 1991.
22. He, X., On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 1993, to appear.
23. He, X., and M.-Y. Kao, Parallel construction of canonical ordering and convex drawing of triconnected planar graphs, in Proc. 4th Symp. on Algorithms and Computation (ISAAC '93), Lecture Notes in Computer Science, Vol. 762, 1993, pp. 303-312.
24. Hopcroft, J., and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973), 135-158.
25. Hopcroft, J., and R. E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21 (1974), 549-568.
26. Jayakumar, R., K. Thulasiraman, and M. N. S. Swamy, Planar embedding: linear-time algorithms for vertex placement and edge ordering, IEEE Trans. Circuits and Systems 35 (1988), 334-344.
27. Kant, G., Hexagonal grid drawings, in Proc. 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '92), Lecture Notes in Computer Science, Vol. 657, Springer-Verlag, Berlin, 1992, 263-276.
28. Kant, G., Algorithms for Drawing Planar Graphs, Ph.D. thesis, Dept. of Computer Science, Utrecht University, 1993.
29. Kant, G., The planar triconnectivity augmentation problem, submitted to Theoret. Comput. Sci., 1993.
30. Kant, G., A more compact visibility representation, in Proc. 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '93), Lecture Notes in Computer Science, Vol. 790, Springer-Verlag, Berlin, 1994, 411-424.
31. Kant, G., and X. He, Two algorithms for finding rectangular duals of planar graphs, in Proc. 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '93), Lecture Notes in Computer Science, Vol. 790, Springer-Verlag, 1994, pp. 396-410.
32. Lempel, A., S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs, Theory of Graphs, International Symp., Rome, 1966, pp. 215-232.
33. Liu, Y., P. Marchioro, and R. Petreschi, At most single-bend embeddings of cubic graphs, Appl. Math., 1994, to appear.
34. Liu, Y., P. Marchioro, R. Petreschi, and B. Simeone, Theoretical Results on at Most 1-Bend Embeddability of Graphs, Tech. Rep., Dept. of Statistics, University "La Sapienza" Roma, 1990.
35. Lin, Y.-L., and S. S. Skiena, Complexity Aspects of Visibility Graphs, Rep. 92-08, Dept. of Computer Science, State University of New York, Stony Brook, NY, 1992.
36. Malitz, S., and A. Papakostas, On the angular resolution of planar graphs, SIAM J. Discrete Math. 7 (1994), 172-183.
37. Nummenmaa, J., Constructing compact rectilinear planar layouts using canonical representation of planar graphs, Theoret. Comput. Sci. 99 (1992), 213-230.
38. Rosenstiehl, P., and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom. 1 (1986), 343-353.
39. Schnyder, W., Embedding planar graphs on the grid, in Proc. 1st Annual ACM-SIAM Symp. on Discrete Algebra (SODA '90), 1990, pp. 138-147.
40. Stein, S. K., Convex maps, Proc. Amer. Math. Soc. 2 (1951), 464-466.
41. Storer, J. A., On minimal node-cost planar embeddings, Networks 14 (1984), 181-212.
42. Tamassia, R., On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), 421-444.
43. Tamassia, R., and I. G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits and Systems, 36 (1989), 1230-1234.
44. Tamassia, R., and I. G. Tollis, A unified approach to visibility representations of planar graphs, Discrete and Comput. Geom. 1 (1986), 321-341.
45. Tamassia, R., I. G. Tollis, and J. S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inform. Process. Lett. 39 (1991), 35-40.
46. Thomassen, C., Planarity and duality of finite and infinite planar graphs, J. Combin. Theory Ser. B 29 (1980), 244-271.
47. Tutte, W. T., Convex representations of graphs, Proc. London Math. Soc. 10 (1960), 302-320.
48. Tutte, W. T., How to draw a graph, Proc. London Math. Soc. 13 (1963), 743-768.
49. Wagner, K., Bemerkungen zum vierfarbenproblem, Jahresber. Deutsch. Math.-Verein. 46 (1936), 26-32.