Convex grid drawings of four-connected plane graphs (Extended abstract)

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

Volumn 1969, Issue , 2000, Pages 254-265

  Miura, Kazuyuki ^a   Nakano, Shin Ichi ^b   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

CONVEX DRAWINGS; CONVEX POLYGON; EXTENDED ABSTRACTS; GRID DRAWING; INFINITE NUMBERS; LINEAR-TIME ALGORITHMS; PLANE GRAPHS; STRAIGHT-LINE SEGMENTS;

GRAPH THEORY;

EID: 77249093174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_22     Document Type: Conference Paper

References (16)

1. G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing, Prentice Hall, NJ (1999).
2. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, International Journal of Computational Geometry and Applications, 7, 211-223 (1997).
3. M. Chrobak and S. Nakano, Minimum-width grid drawings of plane graphs, Computational Geometry: Theory and Applications, 10, 29-54 (1998).
4. N. Chiba, K. Onoguchi and T. Nishizeki, Drawing planar graphs nicely, Acta Inform., 22, 187-201 (1985).
5. M. Chrobak and T. Payne, A linear-time algorithm for drawing planar graphs on a grid, Information Processing Letters, 54, 241-246 (1995).
6. N. Chiba, T. Yamanouchi and T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in Progress in Graph Theory, J.A. Bondy and U.S.R. Murty (eds.), Academic Press, 153-173 (1984).
7. I. Fáry, On straight lines representation of plane graphs, Acta. Sci. Math. Szeged, 11, 229-233 (1948).
8. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10, 41-51 (1990).
9. X. He, Grid embedding of 4-connected plane graphs, Discrete & Computational Geometry, 17, 339-358 (1997).
10. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16, 4-32 (1996).
11. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, 172, 175-193 (1997).
12. K. Miura, S. Nakano and T. Nishizeki, Grid drawings of four-connected plane graphs, Proc. Graph Drawing'99 (GD'99), LNCS 1731, 145-154 (1999).
13. S. Nakano, M. Saidur Rahman and T. Nishizeki, A linear time algorithm for four partitioning four-connected planar graphs, Information Processing Letters, 62, 315-322 (1997).
14. W. Schnyder, Embedding planar graphs in the grid, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 138-147 (1990).
15. W. Schnyder and W. Trotter, Convex drawings of planar graphs, Abstracts of the AMS, 13, 5, 92T-05-135 (1992).
16. W.T. Tutte, How to draw a graph, Proc. London Math. Soc., 13, 743-768 (1963).