Improved compact visibility representation of planar graph via Schnyder's realizer

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 1, 2004, Pages 19-29

  Lin, Ching Chi ^a   Lu, Hsueh I ^a   Sun, I Fan ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Canonical ordering; Graph drawing; Planar graph algorithm; Realizer; Visibility representation

Indexed keywords

ALGORITHMS; CALCULATIONS; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

CANONICAL ORDERING; GRAPH DRAWING; PLANAR GRAPH ALGORITHMS; REALIZER; VISIBILITY REPRESENTATION;

GRAPH THEORY;

EID: 14644426536     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103420744     Document Type: Article

References (33)

1. N. BONICHON, C. GAVOILLE, AND N. HANUSSE, An information-theoretic upper bound of planar graphs using triangulation, in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, H. Alt and M. Habib, eds., Lecture Notes in Comput. Sci. 2607, Springer-Verlag, Berlin, 2003, pp. 499-510.
2. N. BONICHON, B. LE SAËC, AND M. MOSBAH, Wagner's theorem on realizers, in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, eds., Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 1043-1053.
3. 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 the 10th International Symposium on Graph Drawing, S. G. Kobourov and M. T. Goodrich, eds., Lecture Notes in Comput. Sci. 2528, Springer-Verlag, Berlin, 2002, pp. 332-343.
4. 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 12th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp. 506-515.
5. M. CHROBAK AND G. KANT, Convex grid drawings of 3-connected planar graphs, Internat. J. Comput. Geom. Appl., 7 (1997), pp. 211-223.
6. R. C.-N. CHUANG, A. GARG, X. HE, M.-Y. KAO, AND H.-I. LU, Compact encodings of planar graphs via canonical ordering and multiple parentheses, in Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, K. G. Larsen, S. Skyum, and G. Winskel, eds., Lecture Notes in Comput. Sci. 1443, Springer-Verlag, Berlin, 1998, pp. 118-129.
7. H. DE FRAYSSEIX, P. OSSONA DE MENDEZ, AND P. ROSENSTIEHL, On triangle contact graphs, Combin. Probab. Comput., 3 (1994), pp. 233-246.
8. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
9. G. DI BATTISTA, R. TAMASSIA, AND I. G. TOLLIS, Constrained visibility representations of graphs, Inform. Process. Lett., 41 (1992), pp. 1-7.
10. S. EVEN AND R. E. TARJAN, Computing an st-numbering, Theoret. Comput. Sci., 2 (1976), pp. 436-441.
11. U. FÖSSMEIER, G. KANT, AND M. KAUFMANN, 2-visibility drawings of planar graphs, in Proceedings of the 4th International Symposium on Graph Drawing, S. North, ed., Lecture Notes in Comput. Sci. 1190, Springer-Verlag, Berlin, 1997, pp. 155-168.
12. X. HE, On floor-plan of plane graphs, SIAM J. Comput., 28 (1999), pp. 2150-2167.
13. X. HE, A simple linear time algorithm for proper box rectangular drawings of plane graphs, J. Algorithms, 40 (2001), pp. 82-101.
14. A. KANEVSKY, R. TAMASSIA, G. Di BATTISTA, AND J. CHEN, On-line maintenance of the four-connected components of a graph, in Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1991, pp. 793-801.
15. G. KANT, A more compact visibility representation, in Proceedings of the 19th Workshop on Graph-Theoretic Concepts in Computer Science, J. van Leeuwen, ed., Lecture Notes in Comput. Sci. 790, Springer-Verlag, Berlin, 1994, pp. 411-424.
16. G. KANT, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996), pp. 4-32.
17. G. KANT, A more compact visibility representation, Internat. J. Comput. Geom. Appl., 7 (1997), pp. 197-210.
18. G. KANT AND X. HE, Two algorithms for finding rectangular duals of planar graphs, in Proceedings of the 19th Workshop on Graph-Theoretic Concepts in Computer Science, J. van Leeuwen, ed., Lecture Notes in Comput. Sci. 790, Springer-Verlag, Berlin, 1994, pp. 396-410.
19. 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.
20. 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, P. Mutzel, M. Jünger, and S. Leipert, eds., Lecture Notes in Comput. Sci. 2265, Springer-Verlag, Berlin, 2002, pp. 367-377.
21. C.-C. LIN, H.-I. LU, AND I.-F. SUN, Improved compact visibility representation of planar graph via Schnyder's realizer, in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, H. Alt and M. Habib, eds., Lecture Notes in Comput. Sci. 2607, Springer-Verlag, Berlin, 2003, pp. 14-25.
22. H.-I. LU, Improved compact routing tables for planar networks via orderly spanning trees, in Proceedings of the 8th International Conference on Computing and Combinatorics, O. H. Ibarra and L. Zhang, eds., Lecture Notes in Comput. Sci. 2387, Springer-Verlag, Berlin, 2002, pp. 57-66.
23. C.-I. NAKANO, Planar drawings of plane graphs, IEICE Trans. Inform. Systems, E83-D (2000), pp. 384-391.
24. J. NUMMENMAA, Constructing compact rectilinear planar layouts using canonical representation of planar graphs, Theoret. Comput. Sci., 99 (1992), pp. 213-230.
25. R. OTTEN AND J. VAN WIJK, Graph representations in interactive layout design, in Proceedings of the IEEE International Symposium on Circuits and Systems, 1978, pp. 914-918.
26. P. ROSENSTIEHL AND R. E. TARJAN, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom., 1 (1986), pp. 343-353.
27. M. SCHLAG, F. LUCCIO, P. MAESTRINI, D. T. LEE, AND C. K. WONG, A visibility problem in VLSI layout compaction, in Advances in Computing Research, vol. 2, F. P. Preparata, ed., JAI Press, Greenwich, CT, 1985, pp. 259-282.
28. W. SCHNYDER, Planar graphs and poset dimension, Order, 5 (1989), pp. 323-343.
29. W. SCHNYDER, Embedding planar graphs on the grid, in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1990, pp. 138-148.
30. R. TAMASSIA AND I. G. TOLLIS, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom., 1 (1986), pp. 321-341.
31. R. TAMASSIA AND I. G. TOLLIS, Planar grid embedding in linear time, IEEE Trans. Circuits Systems, 36 (1989), pp. 1230-1234.
32. K. WAGNER, Bemerkungen zum vierfarbenproblem, Jahresber. Deutsch. Math.-Verein, 46 (1936), pp. 26-32.
33. H. ZHANG AND X. HE, Compact visibility representation and straight-line grid embedding of plane graphs, in Proceedings of the 8th International Workshop on Algorithms and Data Structures, F. Dehne, J. R. Sackand, and M. Smid, eds., Lecture Notes in Comput. Sci. 2748, Springer-Verlag, Berlin, 2003, pp. 493-504.