论文信息 - Strictly Convex Drawings of Planar Graphs - 字舞流文

Strictly Convex Drawings of Planar Graphs

Every three-connected planar graph with n vertices has a drawing on an O(n) O(n) grid in which all faces are strictly convex polygons.

Ôôöøøøøóò Óó | Óò Ò Ç´ò ¿ Μ ¢ Ç´ò ¿ Μ Ööö¸´´´µ | Óö Ñóö Òòöððý¸óò Ò Ç´ò ¾ × ¾ Μ ¢ Ç´ò | Ööö¸óö Òý | Óóó Óó Ôöññøøö | Ô Ò¸´´´´µ | Óö Óò | Ò Ç´òµ | Ç´ò ¿ Μ Öööº | Óö Ñóö Òòöððý¸óò Ò Ç´ò ¾ × ¾ Μ ¢ Ç´ò | Ööö¸óö Òý | Óóó Óó Ôöññøøö | Ô Ò¸´´´´µ | Ò Ç´òµ

[1] Marek Chrobak,et al. Convex drawings of graphs in two and three dimensions (preliminary version) , 1996, SCG '96.

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

[3] Jürgen Richter-Gebert. Realization Spaces of Polytopes , 1996 .

[4] W. T. Tutte. Convex Representations of Graphs , 1960 .

[5] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .

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

[7] Stefan Felsner,et al. Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.

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