Compact visibility representation and straight-line grid embedding of plane graphs

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

Volumn 2748, Issue , 2003, Pages 493-504

  Zhang, Huaming ^a   He, Xin ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS); VISIBILITY;

CANONICAL ORDERING; LINEAR TIME; PLANE GRAPHS; VISIBILITY REPRESENTATION;

GRAPH THEORY;

EID: 21144453820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_43     Document Type: Article

References (21)

1. N. Bonichon, B. L. Saëc and M. De la Libération, Wagner's theorem on realizers. Proc. of The 29th International Colloquium on Automata, Languages and Programming, LNCS 2380, pp. 1043-1053, 2002.
2. E. Brehm, 3-Orientations and Schnyder 3-tree-decompositions. Diploma Thesis, FB mathematik und Informatik, Freie Universität Berlin, 2000.
3. H.-L. Chen, C.-C. Liao, H.-I. Lu and H.-C. Yen, Some applications of orderly spanning trees in graph drawing. Proc. Graph Drawing'02, LNCS 2528, pp. 332-343, 2002.
4. Y.-T. Chiang, C.-C. Lin and H.-I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing. Proc. of the 12th Annual ACM-SIAM SODA, pp. 506-515, 2001.
5. U. Fößmeier, G. Kant and M. Kaufmann, 2-Visibility drawings of planar graphs. Proc. 4th International Symposium on Graph Drawing, LNCS 1190, pp. 155-168, 1996.
6. H. de Fraysseix, J. Pach and R. Pollack, Small sets supporting Straight-Line embeddings of planar graphs. Proc. 20th Annual Symposium on Theory of Computing, pp. 426-433, 1988.
7. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid. Combinatorica 10, pp. 41-51, 1990.
8. X. He, Grid Embedding of 4-connected Plane Graphs. Discrete Comput. Geom. 17, pp. 339-358, 1997.
9. X. He, On floor-plan of plane graphs. SIAM Journal on Computing 28(6), pp. 2150-2167, 1999.
10. X. He, M.-Y. Kao and H.-I. Lu, Linear-time succinct encodings of planar graphs via canonical orderings. SIAM Journal Discrete Math 12(3), pp. 317-325, 1999.
11. G. Kant, Drawing planar graphs using the lmc-ordering. Proc. 33rd Symposium on Foundations of Computer Science, Pittsburgh, pp.101-110, 1992.
12. G. Kant, Algorithms for Drawing Planar Graphs, Ph.D. Dissertation, Department of Computer Science, University of Utrecht, 1993.
13. G. Kant, A more compact visibility representation. International Journal of Computational Geometry & Applications 7(3), pp. 197-210, 1997
14. A. Lempel, S. Even and I. Cederbaum, An algorithm for planarity testing of graphs. Theory of Graphs (Proc. of an International Symposium, Rome, July 1966), pp. 215-232, 1967.
15. C.-C. Liao, H.-I. Lu and H.-C. Yen, Floor-planning via orderly spanning trees. Proc. 9th International Symposium on Graph Drawing (GD 2001), LNCS 2265, pp. 367-377, 2002.
16. C.-C. Lin, H.-I. Lu and I-F. Sun, Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2607, pp. 14-25, 2003.
17. K. Miura, S. Nakano and T. Nishizeki, Grid Drawings of 4-Connected Plane Graphs. Discrete Comput. Geom. 26, pp. 73-87, 2001.
18. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1, pp. 343-353, 1986.
19. W. Schnyder, Planar graphs and poset dimension. Order 5, pp. 323-343, 1989.
20. W. Schnyder, Embedding planar graphs on the grid. Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138-148, 1990.
21. R. Tamassia and I.G. Tollis, An unified approach to visibility representations of planar graphs. Discrete & Computational Geometry 1(4), pp. 321-341, 1986.