An application of well-orderly trees in graph drawing

International Journal of Foundations of Computer Science

Volumn 17, Issue 5, 2006, Pages 1129-1141

  Zhang, Huaming ^a   Xin, H E ^b  

^a University of Alabama in Huntsville   (United States)

^b State University of New York   (United States)

Author keywords

Plane graph; Plane triangulation; Visibility representation; Well orderly tree

Indexed keywords

EID: 33748801189     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054106004303     Document Type: Article

References (28)

1. G. di Battista, P. Eades, R. Tammassia, and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Princeton Hall, 1998.
2. N. Bonichon, B. Le Saëc and M. Mosbah, Wagner's theorem on realizers, in: Proc. ICALP'02, Lecture Notes in Computer Science, Vol. 2380, (Springer, Berlin, 2002) 1043-1053.
3. N. Bonichon, C. Gavoille, and N. Hanusse, An information-theoretic upper bound of planar graphs using triangulation, in Proc. STACS'03, pp 499-510, Lectures Notes in Computer Science, Vol. 2607, Springer-Verlag, 2003.
4. N. Bonichon, C. Gavoille, and N. Hanusse, An information-theoretic upper bound of planar graphs using triangulation, Research Report RR-1279-02, LaBRI, University of Bordeaux, France.
5. N. Bonichon, C. Gavoille, and N. Hanusse, Canonical decomposition of outerplanar maps and application to enumeration, coding and generation, Journal of Graph Algorithms and Applications, 9 (2005), 185-204.
6. E. Brehm, 3-Orientations and Schnyder 3-Tree-Decompositions: Construction and Order Structure, Diploma thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000.
7. 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.
8. Y.-T. Chiang, C.-C. Lin and H.-I. Lu, Orderly spanning trees with applications, SIAM Journal on Computing 34 (2004), 373-387.
9. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, International journal of computational geometry and applications 7 (1997), 211-223. Department of Computer Science, Utrecht University, Holland, 1993.
10. 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.
11. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid. Combinatorica 10 (1990), 41-51.
12. G. Kant, Algorithms for drawing planar graphs, Ph.D. Dissertation, Department of Computer Science, University of Utrecht, Holland, 1993.
13. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica 16 (1996), 4-32.
14. G. Kant, A more compact visibility representation, International Journal of Computational Geometry and Applications 7 (1997), 197-210.
15. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science 172 (1997), 175-193.
16. M. Kaufmann and D. Wagner, Drawing Graphs: Methods and Models, Springer, 2001.
17. 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, Rome, 1967.
18. C.-C. Liao, H.-I. Lu and H.-C. Yen, Compact floor-planning via orderly spanning trees, Journal of Algorithms, 48 (2003), 441-451.
19. C.-C. Lin, H.-I. Lu and I-F. Sun, Improved compact visibility representation of planar graph via Schnyder's realizer, SIAM Journal on Discrete Mathematics, 18 (2004), 19-29.
20. P. Ossona de Mendez, Orientations bipolaires, PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994.
21. T. Nishizeki, and M. S. Rahman, Planar Graph Drawing, World Scientific Publishing Company, 2004.
22. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete &: Computational Geometry 1 (1986), 343-353.
23. W. Schnyder, Planar graphs and poset dimension. Order 5 (1989), 323-343.
24. W. Schnyder, Embedding planar graphs on the grid, in Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138-148, SIAM, Philadelphia, 1990.
25. R. Tamassia and I.G.Tollis, A unified approach to visibility representations of planar graphs. Discrete & Computational Geometry 1 (1986), 321-341.
26. H. Zhang and X. He, Canonical ordering trees and their applications in graph drawing, Discrete & Computational Geometry 33 (2005), 321-344.
27. H. Zhang and X. He, Visibility representation of plane graphs via canonical ordering tree, Information Processing Letters 96 (2005), 41-48.
28. H. Zhang and X. He, Improved visibility representation of plane graphs, Computational Geometry: Theory and Applications 30 (2005), 29-29.