论文信息 - A Linear-Time Algorithm for Drawing a Planar Graph on a Grid

A Linear-Time Algorithm for Drawing a Planar Graph on a Grid

Abstract We present a linear-time algorithm that, given an n -vertex planar graph G , finds an embedding of G into a (2 n − 4) × ( n − 2) grid such that the edges of G are straight-line segments.

Marek Chrobak | Thomas H. Payne | M. Chrobak | T. H. Payne

[1] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[2] K. Wagner. Bemerkungen zum Vierfarbenproblem. , 1936 .

[3] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.

[4] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[5] Goos Kant,et al. Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[6] W. T. Tutte. How to Draw a Graph , 1963 .

[7] H. S. M. Coxeter,et al. Vorlesungen über die Theorie der Polyeder , 1935 .

[8] J. A. Bondy,et al. Progress in Graph Theory , 1984 .

[9] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..

[10] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[11] G. Kant. Algorithms for drawing planar graphs , 1993 .

[12] M. Chrobak,et al. Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[13] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..