On visibility representation of plane graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 477-488

  Zhang, Huaming ^a   He, Xin ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS); VISIBILITY;

4-CONNECTED; ADJACENT VERTICES; CANONICAL ORDERING; LINE SEGMENT; LINEAR TIME; PLANE GRAPHS; VERTICAL LINES; VISIBILITY REPRESENTATION;

GRAPH THEORY;

EID: 24144462653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_42     Document Type: Article

References (15)

1. 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, 1043-1053.
2. 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.
3. Y.-T. Chiang, C.-C. Lin and H.-I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in Proc. of the 12th Annual ACM-SIAM SODA, pp. 506-515, ACM Press, New York, 2001.
4. H. de Praysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid. Combinatorial 10 (1990), 41-51.
5. X. He, On finding the rectangular duals of planar triangular graphs. SIAM Journal on Computing 22 (1993), 1218-1226.
6. X. He, M.-Y. Kao and H.-I. Lu, Linear-time succinct encodings of planar graphs via canonical orderings. SIAM Journal Discrete Math 12 (1999), 317-325.
7. G. Kant, A more compact visibility representation. International Journal of Computational Geometry and Applications 7 (1997), 197-210.
8. 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.
9. 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.
10. 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.
11. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1 (1986), 343-353.
12. W. Schnyder, Planar graphs and poset dimension. Order 5 (1989), 323-343.
13. 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.
14. R. Tamassia and I.G.Tollis, An unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1 (1986), 321-341.
15. H. Zhang and X. He, Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs, in: Proc. WADS'03, Lecture Notes in Computer Science, Vol. 2748, (Springer, Berlin, 2003) 493-504.