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

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

Volumn 2607, Issue , 2003, Pages 14-25

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

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b NONE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; TREES (MATHEMATICS); VISIBILITY;

ADJACENT NODES; CANONICAL ORDERING; CONNECTED COMPONENT; HORIZONTAL SEGMENTS; LOWER BOUNDS; PLANAR GRAPH; TIME ALGORITHMS; VISIBILITY REPRESENTATION;

GRAPH THEORY;

EID: 21144441194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (30)

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, Berlin, Germany, 2003. To appear.
2. N. Bonichon, B. L. Saëc, and M. Mosbah. Wagner's theorem on realizers. In Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, LNCS 2380, pages 1043-1053, Malaga, Spain, 2002.
3. H.-L. Chen, C.-G. Liao, H.-I. Lu, and H.-C. Yen. Some applications of orderly spanning tree in graph drawing. In Proceedings of the 10th International Symposium on Graph Drawing, LNCS 2528, pages 332-343, Irvine, California, 2002.
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, pages 506-515, Washington, D. C., USA, 7-9 Jan. 2001.
5. M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry & Applications, 7(3):211-223, 1997.
6. H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl. On triangle contact graphs. Combinatorics, Probability and Computing, 3:233-246, 1994.
7. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
8. G. Di Battista, R. Tamassia, and I. G. Tollis. Constrained visibility representations of graphs. Information Processing Letters, 41:1-7, 1992.
9. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:436-441, 1976.
10. U. Fößmeier, G. Kant, and M. Kaufmann. 2-visibility drawings of planar graphs. In S. North, editor, Proceedings of the 4th International Symposium on Graph Drawing, LNCS 1190, pages 155-168, California, USA, 1996.
11. X. He. On floor-plan of plane graphs. SIAM Journal on Computing, 28(6):2150-2167, 1999.
12. X. He. A simple linear time algorithm for proper box rectangular drawings of plane graphs. Journal of Algorithms, 40(1):82-101, 2001.
13. 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, pages 793-801, San Juan, Puerto Rico, 1991. IEEE.
14. G. Kant. A more compact visibility representation. In Proceedings of the 19th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 790, pages 411-424, Utrecht, Netherlands, 1994.
15. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4-32, 1996.
16. G. Kant. A more compact visibility representation. International Journal of Computational Geometry & Applications, 7(3):197-210, 1997.
17. 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, LNCS 790, pages 396-410, Utrecht, Netherlands, 1994.
18. G. Kant and X. He. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science, 172(1-2):175-193, 1997.
19. 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, LNCS 2265, pages 367-377, Vienna, Austria, 2001.
20. H.-I. Lu. Improved compact routing tables for planar networks via orderly spanning trees. In O. H. Ibarra and L. Zhang, editors, Proceedings of the 8th International Conference on Computing and Combinatorics, LNCS 2387, pages 57-66, Singapore, August 15-17 2002.
21. C.-i. Nakano. Planar drawings of plane graphs. IEICE Transactions on Information and Systems, E83-D(3):384-391, Mar. 2000.
22. J. Nummenmaa. Constructing compact rectilinear planar layouts using canonical representation of planar graphs. Theoretical Computer Science, 99(2):213-230, 1992.
23. R. Otten and J. van Wijk. Graph representations in interactive layout design. In Proceedings of the IEEE International Symposium on Circuits and Systems, pages 914-918, 1978.
24. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete & Computational Geometry, 1(4):343-353, 1986.
25. M. Schlag, F. Luccio, P. Maestrini, D. T. Lee, and C. K. Wong. A visibility problem in VLSI layout compaction. In F. P. Preparata, editor, Advances in Computing Research, volume 2, pages 259-282. JAI Press Inc. Greenwich, CT, 1985.
26. W. Schnyder. Planar graphs and poset dimension. Order, 5:323-343, 1989.
27. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 138-148, 1990.
28. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete & Computational Geometry, 1(4):321-341, 1986.
29. R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Transactions in Circuits and Systems, 36:1230-1234, 1989.
30. K. Wagner. Bemerkungen zum Vierfarbenproblem. Jahresber Deutsche Math. -Verein, 46:26-32, 1936.