Convex drawings of 3-connected plane graphs

Algorithmica (New York)

Volumn 47, Issue 4, 2007, Pages 399-420

  Bonichon, Nicolas ^a   Felsner, Stefan ^b   Mosbah, Mohamed ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Compact representation; Convex drawing; Graph drawing; Plane graph; Schnyder wood

Indexed keywords

COMPACT REPRESENTATION; GRAPH DRAWING; PLANE GRAPHS; RANDOM TRIANGULATION;

ALGORITHMS; DRAWING (GRAPHICS); WOOD;

GRAPH THEORY;

ALGORITHMS; DRAWINGS; WOOD;

EID: 33947572741     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0177-6     Document Type: Conference Paper

References (26)

1. N. Bonichon, S. Felsner, and M. Mosbah, Convex drawings of 3-connected planar graphs (extended abstract), in Proc. GD '04, vol. 3383 of Lecture Notes Comput. Sci., Springer-Verlag, Berlin, 2004, pp. 60-70.
2. N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer, Planar graphs, via well-orderly maps and trees, in Proc. WG '04, vol. 3353 of Lecture Notes Comput. Sci., Springer-Verlag, Berlin, 2004, pp. 270-284.
3. N. Bonichon, B. Le Saëc, and M. Mosbah, Wagners theorem on realizers, in Proc. ICALP '02, vol. 2380 of Lecture Notes Comput. Sci., Springer-Verlag, Berlin, 2002, pp. 1043-1053.
4. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, Internat. J. Comput. Geom. Appl., 7 (1997), 211-223.
5. H. de Fraysseix, J. Pach, and R. Pollack, Small sets supporting Fary embeddings of planar graphs, in Proc. 20th Annu. ACM Sympos. Theory Comput., 1988, pp. 426-433.
6. H. de Fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10 (1990), 41-51.
7. G. Di Battista, R. Tamassia, and L. Vismara, Output-sensitive reporting of disjoint paths, Algorithmica, 23(1999), 302-340.
8. S. Felsner, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order, 18 (2001), pp. 19-37.
9. S. Felsner, Geometric Graphs and Arrangements, Vieweg Verlag, Braunschweig, 2004.
10. S. Felsner, Lattice structures from planar graphs, Electron. J. Combin., 11 R15 (2004), 1-24.
11. E. Fusy, D. Poulalhon, and G.Schaeffer, Coding, counting and sampling 3-connected planar graphs, in Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, 2005, pp. 690-699.
12. X. He, Grid embeddings of 4-connected plane graphs, Discrete Comput. Geom., 17 (1997), 339-358.
13. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996), 4-32.
14. C. Lin, H. Lu, and I. Sun, Improved compact visibility representation of planar graph via Schnyder's realizer, in Proc. STAC.S '03, vol. 2607 of Lecture Notes Comput. Sci., Springer-Verlag, Berlin, 2003, pp. 14-25.
15. E. Miller, Planar graphs as minimal resolutions of trivariate monomial ideals, Doc. Math., 1 (2002), 43-90.
16. K. Miura, S. Nakano, and T. Nishizeki, Grid drawings of 4-connected plane graphs, Discrete Comput. Geom., 26 (2001), 73-87.
17. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom., 1 (1986), 343-353.
18. G. Rote, Strictly convex drawings of planar graphs, in Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, 2005, pp. 728-734.
19. G. Schaeffer, Random sampling of large planar maps and convex polyhedra, in Proc. 31s/ Annu. ACM Sympos. Theory Comput. (Atlanta, GA, 1999), 1999, pp. 760-769.
20. W. Schnyder, Planar graphs and poset dimension, Order, S (1989), 323-343.
21. W. Schnyder, Embedding planar graphs on the grid, in Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 1990, pp. 138-148.
22. W. Schnyder and W. T. Trotter, Convex embeddings of 3-connected plane graphs, Abstracts of the Amer. Math. Soc., 13 (1992), 502.
23. C. Thomassen, Planarity and duality of finite and infinite planar graphs, J. Combin. Theory Ser. B, 29 (1980), 244-271.
24. W. T. Tutte, Convex representations of graphs, Proc. London Math. Soc., 10 (1960), 304-320.
25. W. T. Tutte, How to draw a graph, Five. London Math. Soc., 13 (1963), 743-768.
26. H. Zhang and X. He, Compact visibility representation and straight-line grid embedding of plane graphs, Proc. WADS '03, vol. 2748 of Lecture Notes Comput. Sci., Springer-Verlag, Berlin, 2003, pp. 493-504.