Nearly optimal visibility representations of plane graphs

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 4, 2008, Pages 1364-1380

  He, Xin ^a   Zhang, Huaming ^b  

^a State University of New York   (United States)

^b University of Alabama in Huntsville   (United States)

Author keywords

Plane graph; Plane triangulation; St orientation; Visibility representation

Indexed keywords

A-PLANE; CLASSICAL REPRESENTATION; LINEAR TIME; LOWER BOUNDS; OTHER APPLICATIONS; PLANE GRAPH; PLANE GRAPHS; SPECIAL PROPERTIES; UPPER BOUND; VISIBILITY REPRESENTATION;

TRIANGULATION;

VISIBILITY;

EID: 68749105560     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060651811     Document Type: Article

References (30)

1. N. Bonichon, S. Felsner, and M. Mosbah, Convex drawings of 3-connected plane graphs, Algorithmica, 47 (2007), pp. 399-420. (Pubitemid 46479911)
2. N. Bonichon, C. Gavoille, and N. Hanusse, An information-theoretic upper bound of planar graphs using triangulation, in Proceedings of STACS'03, Lectures Notes in Comput. Sci. 2607, Springer-Verlag, Berlin, 2003, pp. 499-510. (Pubitemid 36309301)
3. N. Bonichon, B. Le Säec, and M. Mosbah, Wagner's theorem on realizers, in Proceedings of ICALP'02, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 1043- 1053.
4. H.-L. Chen, C.-C. Liao, H.-I. Lu, and H.-C. Yen, Some applications of orderly spanning trees in graph drawing, in Proceedings of Graph Drawing'02, Lecture Notes in Comput. Sci. 2528, Springer-Verlag, Berlin, 2002, pp. 332-343.
5. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2001, pp. 506-515.
6. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu, Orderly spanning trees with applications, SIAM J. Comput., 34 (2005), pp. 924-945.
7. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, Upper Saddle River, NJ, 1998.
8. G. Di Battista, R. Tamassia, and L. Vismara, Output-sensitive reporting of disjoint paths, Algorithmica, 23 (1999), pp. 302-340. (Pubitemid 129565532)
9. S. Felsner and F. Zickfeld, Schnyder woods and orthogonal surfaces, in Proceedings of the 14th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 4372, Springer-Verlag, Berlin, 2007, pp. 417-429.
10. U. Fößmeier, G. Kant, and M. Kaufmann, 2-visibility drawings of planar graphs, in Proceedings of the 4th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 1190, Springer-Verlag, Berlin, 1996, pp. 155-168. (Pubitemid 127024208)
11. H. de Fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
12. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996), pp. 4- 32. (Pubitemid 126418814)
13. G. Kant, A more compact visibility representation, Internat. J. Comput. Geom. Appl., 7 (1997), pp. 197-210. (Pubitemid 127072242)
14. 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), pp. 175-193. (Pubitemid 127451829)
15. A. Lempel, S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs, in Theory of Graphs (Internat. Sympos. Rome, 1966), Gordon and Breach, New York, Dunod, Paris, 1967, pp. 215-232.
16. C.-C. Liao, H.-I. Lu, and H.-C. Yen, Floor-planning via orderly spanning trees, in Proceedings of the 9th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 2265, Springer-Verlag, Berlin, 2002, pp. 367-377.
17. C.-C. Lin, H.-I. Lu, and I-F. Sun, Improved compact visibility representation of planar graph via Schnyder's realizer, SIAM J. Discrete Math., 18 (2004), pp. 19-29.
18. K. Miura, M. Azuma, and T. Nishizeki, Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs, Int. J. Found. Comput. Sci., 16 (2005), pp. 117- 141. (Pubitemid 44099465)
19. P. Ossona de Mendez, Orientations bipolaires, Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994.
20. C. Papamanthou and I. G. Tollis, Applications of parameterized st-orientations in graph drawing algorithms, in Proceedings of the 13th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 3843, Springer-Verlag, Berlin, 2006, pp. 355-367. (Pubitemid 43971530)
21. C. Papamanthou and I. G. Tollis, Parameterized st-orientations of graphs: Algorithms and experiments, in Proceedings of the 14th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 4372, Springer-Verlag, Berlin, 2007, pp. 220-233.
22. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom., 1 (1986), pp. 343-353.
23. W. Schnyder, Planar graphs and poset dimension, Order, 5 (1989), pp. 323-343.
24. W. Schnyder, Embedding planar graphs on the grid, in Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1990, pp. 138-148.
25. R. Tamassia and I. G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom., 1 (1986), pp. 321-341.
26. H. Zhang and X. He, Canonical ordering trees and their applications in graph drawing, Discrete Comput. Geom., 33 (2005), pp. 321-344. (Pubitemid 40176440)
27. H. Zhang and X. He, Visibility representation of plane graphs via canonical ordering tree, Inform. Process. Lett., 96 (2005), pp. 41-48. (Pubitemid 41537080)
28. H. Zhang and X. He, Improved visibility representation of plane graphs, Comput. Geom., 30 (2005), pp. 29-29
29. H. Zhang and X. He, An application of well-orderly trees in graph drawing, in Proceedings of the 13th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 3843, Springer-Verlag, Berlin, 2006, pp. 458-467. (Pubitemid 43971539)
30. H. Zhang and X. He, Optimal st-orientations for plane triangulations, J. Comb. Optim., to appear.