Canonical ordering trees and their applications in graph drawing

Discrete and Computational Geometry

Volumn 33, Issue 2, 2005, Pages 321-344

  Zhang, Huaming ^a   He, Xin ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 12944317099     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1154-y     Document Type: Article

References (29)

1. J. Bhasker and S. Sahni, A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks 17 (1987), 307-317.
2. N. Bonichon, B. L. Saëc and M. De la Libération, Wagner's theorem on realizers, in Proc. 29th International Colloquium on Automata, Languages and Programming, pp. 1043-1053, Lecture Notes in Computer Science, Vol. 2380, Springer-Verlag, Berlin, 2002.
3. E. Brehm, 3-Orientations and Schnyder 3-tree-decompositions, Diploma Thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000.
4. H.-L. Chen, C.-C. Liao, H.-I. Lu and H.-C. Yen, Some applications of orderly spanning trees in graph drawing, in Proc. Graph Drawing '02, pp. 332-343, Lecture Notes in Computer Science, Vol. 2528, Springer-Verlag, Berlin, 2002.
5. Y.-T. Chiang, C.-C. Lin and H.-I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in Proc. 12th Annual ACM-SIAM SODA, pp. 506-515, ACM Press, New York, 2001.
6. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, Technical Report RUUCS-93-45, Department of Computer Science, Utrecht University, 1993.
7. M. Chrobak and T. Payne, A linear-time algorithm for drawing a planar graph on a grid, Inform. Process. Lett. 54(1995), 241-246.
8. U. Fößmeier, G. Kant and M. Kaufmann, 2-Visibility drawings of planar graphs, in Proc. 4th International Symposium on Graph Drawing, pp. 155-168, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, Berlin, 1996.
9. H. de Fraysseix and P. Ossona de Mendez, On topological aspects of orientations, Discrete Math. 229 (1-3) (2001), 57-72.
10. H. de Fraysseix, J. Pach and R. Pollack, Small sets supporting straight-line embeddings of planar graphs, in Proc. 20th Annual Symposium on Theory of Computing, pp. 426-433, ACM Press, New York, 1988.
11. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), 41-51.
12. X. He, On finding the rectangular duals of planar triangular graphs, SIAM J. Comput. 22 (1993), 1218-1226.
13. X. He, Grid embedding of 4-connected plane graphs, Discrete Comput. Geom. 17 (1997), 339-358.
14. X. He, On floor-plan of plane graphs, SIAM J. Comput. 28 (1999), 2150-2167.
15. X. He, M.-Y. Kao and H.-I. Lu, Linear-time succinct encodings of planar graphs via canonical orderings, SIAM J. Discrete Math. 12 (1999), 317-325.
16. G. Kant, Drawing planar graphs using the 1mc-ordering, in Proc. 33rd Symposium on Foundations of Computer Science, pp. 101-110, IEEE, Pittsburgh, PA, 1992.
17. G. Kant, Algorithms for drawing planar graphs, Ph.D. Dissertation, Department of Computer Science, University of Utrecht, 1993.
18. G. Kant, A more compact visibility representation, Internat. J. Comput. Geom. Appl. 7 (1997), 197-210.
19. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci. 172 (1997), 175-193.
20. K. Koźmiński and E. Kinnen, Rectangular dual of planar graphs, Networks 15 (1985), 145-157.
21. A. Lempel, S. Even and I. Cederbaum, An algorithm for planarity testing of graphs, in Theory of Graphs (Proc. of an International Symposium, Rome, July 1966), pp. 215-232, 1967.
22. C.-C. Liao, H.-I. Lu and H.-C. Yen, Floor-planning via orderly spanning trees, in Proc. 9th International Symposium on Graph Drawing, pp. 367-377, Lecture Notes in Computer Science, Vol. 2265, Springer-Verlag, Berlin, 2002.
23. C.-C. Lin, H.-I. Lu and I.-F. Sun, Improved compact visibility representation of planar graph via Schnyder's realizer, in Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science, pp. 14-25, Lecture Notes in Computer Science, Vol. 2607, Springer-Verlag, Berlin, 2003.
24. K. Miura, S. Nakano and T. Nishizeki, Grid drawings of 4-connected plane graphs, Discrete Comput. Geom. 26 (2001), 73-87.
25. P. Ossona de Mendez, Orientations bipolaires, Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994.
26. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom. 1 (1985), 343-353.
27. W. Schnyder, Planar graphs and poset dimension, Order 5 (1989), 323-343.
28. W. Schnyder, Embedding planar graphs on the grid, in Proc. First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138-148, SIAM, Philadelphia, PA, 1990.
29. R. Tamassia and I. G. Tollis, An unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986), 321-341.