Strictly convex drawings of planar graphs

Documenta Mathematica

Volumn 11, Issue 1, 2006, Pages 369-391

  Bárány, Imre ^a,b   Rote, Günter ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Graph drawing; Planar graphs

Indexed keywords

EID: 33845391231     PISSN: 14310635     EISSN: 14310635     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Dragan M. Acketa and Jovisa D. Žunić, On the maximal number of edges of convex digital polygons included into a square grid, počítače a umelá inteligencia 1 (1982), no. 6, 549-558.
2. _, On the maximal number of edges of convex digital polygons included into an m × m-grid, J. Comb. Theory, Ser. A 69 (1995), 358-368.
3. Imre Bárány and Norihide Tokushige, The minimum area of convex lattice n-gons, Combinatorica 24 (2004), no. 2, 171-185.
4. Nicolas Bonichon, Stefan Felsner, and Mohamed Mosbah, Convex drawings of 3-connected plane graphs, Graph Drawing: Proc. 12th International Symposium on Graph Drawing (GD 2004), September 29-October 2, 2004 (New York), János Pach, ed. Lecture Notes in Computer Science, vol. 3383, Springer-Verlag, 2005, pp. 60-70.
5. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, Internat. J. Comput. Geom. Appl. 7 (1997), no. 3, 211-223.
6. Marek Chrobak, Michael T. Goodrich, and Roberto Tamassia, Convex drawings of graphs in two and three dimensions, Proc. 12th Ann. Sympos. Comput. Geom., 1996, pp. 319-328.
7. H. de Fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), no. 1, 41-51.
8. Stefan Felsner, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order 18 (2001), 19-37.
9. _, Geodesic embeddings and planar graphs, Order 20 (2003), 135-150.
10. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford Science Publications, 1979.
11. Jürgen Richter-Gebert, Realization Spaces of Polytopes, Lecture Notes in Mathematics, vol. 1643, Springer-Verlag, 1997.
12. Günter Rote, Strictly convex drawings of planar graphs, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, 2005, pp. 728-734.
13. W. Schnyder, Embedding planar graphs on the grid, Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 1990, pp. 138-148.
14. W. Schnyder and W. T. Trotter, Convex embeddings of 3-connected plane graphs, Abstracts of the AMS 13 (1992), no. 5, 502.
15. W. T. Tutte, Convex representations of graphs, Proceedings London Mathematical Society 10 (1960), no. 38, 304-320.
16. _, How to draw a graph, Proceedings London Mathematical Society 13 (1963), no. 52, 743-768.