Visibility representation of plane graphs via canonical ordering tree

Information Processing Letters

Volumn 96, Issue 2, 2005, Pages 41-48

  Zhang, Huaming ^a   He, Xin ^a  

^a State University of New York   (United States)

Author keywords

Graph algorithms; Visibility representation

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

GRAPH ALGORITHMS; PLANAR GRAPHS; VISIBILITY REPRESENTATION;

GRAPH THEORY;

EID: 27544507715     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.05.024     Document Type: Article

References (14)

1. N. Bonichon, B. Le Saëc, M. Mosbah, Wagner's theorem on realizers, in: Proc. ICALP'02, in: Lecture Notes in Comput. Sci., vol. 2380, Springer, Berlin, 2002, pp. 1043-1053.
2. Y.-T. Chiang, C.-C. Lin, H.-I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in: Proc. 12th Annual ACM-SIAM SODA, ACM Press, New York, 2001, pp. 506-515.
3. H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990) 41-51.
4. G. Kant, A more compact visibility representation, Internat. J. Comput. Geom. Appl. 7 (1997) 197-210.
5. G. Kant, X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci. 172 (1997) 175-193.
6. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: Theory of Graphs, Proc. Internat. Symp., Rome, July 1966-1967, pp. 215-232.
7. C.-C. Lin, H.-I. Lu, I.-F. Sun, Improved compact visibility representation of planar graph via Schnyder's realizer, SIAM J. Discrete Math. 18 (2004) 19-29.
8. P. Rosenstiehl, R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom. 1 (1986) 343-353.
9. W. Schnyder, Planar graphs and poset dimension, Order 5 (1989) 323-343.
10. W. Schnyder, Embedding planar graphs on the grid, in: Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, SIAM, Philadelphia, PA, 1990, pp. 138-148.
11. R. Tamassia, I.G. Tollis, An unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
12. H. Zhang, X. He, Compact visibility representation and straight-line grid embedding of plane graphs, in: Proc. WADS'03, in: Lecture Notes in Comput. Sci., vol. 2748, Springer-Verlag, Heidelberg, 2003, pp. 493-504.
13. H. Zhang, X. He, On visibility representation of plane graphs, in: Proc. STACS'04, in: Lecture Notes in Comput. Sci., vol. 2996, Springer-Verlag, Heidelberg, 2004, pp. 477-488.
14. H. Zhang, X. He, Improved visibility representation of plane graphs, Discrete Comput. Geom. 30 (2005) 29.