Realizing Planar Graphs as Convex Polytopes

  • Günter Rote
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7034)


This is a survey on methods to construct a three-dimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3-connected planar graph, focusing on efforts to achieve small integer coordinates.


Convex polytope spiderweb embedding 


  1. 1.
    Acketa, D.M., Žunić, J.D.: On the maximal number of edges of convex digital polygons included into an m×m-grid. J. Comb. Theory Ser. A 69(2), 358–368 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Andrews, G.E.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Trans. Amer. Math. Soc. 99, 272–277 (1961)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bárány, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Math. 11, 369–391 (2006)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Buchin, K., Schulz, A.: On the Number of Spanning Trees a Planar Graph can have. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 110–121. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Comput. Geom. Theory Appl. 8(3), 123–137 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Demaine, E.D., Schulz, A.: Embedding stacked polytopes on a polynomial-size grid. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, pp. 1177–1187 (2011)Google Scholar
  7. 7.
    Lovász, L.: Steinitz representations of polyhedra and the Colin de Verdière number. J. Comb. Theory, Ser. B 82, 223–236 (2000)CrossRefzbMATHGoogle Scholar
  8. 8.
    Maxwell, J.C.: On reciprocal figures and diagrams of forces. Phil. Mag. Ser. 27, 250–261 (1864)Google Scholar
  9. 9.
    Onn, S., Sturmfels, B.: A quantitative Steinitz’ theorem. In: Beiträge zur Algebra und Geometrie, vol. 35, pp. 125–129 (1994)Google Scholar
  10. 10.
    Ribó Mor, A., Rote, G., Schulz, A.: Small grid embeddings of 3-polytopes. Discrete and Computational Geometry 45, 65–87 (2011), MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol. 1643. Springer, Heidelberg (1996)zbMATHGoogle Scholar
  12. 12.
    Schramm, O.: Existence and uniqueness of packings with specified combinatorics. Israel J. Math. 73, 321–341 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Steinitz, E.: Polyeder und Raumeinteilungen. In: Encyclopädie der mathematischen Wissenschaften, vol. III.1.2 (Geometrie), chap. IIIAB12, pp. 1–139. B. G. Teubner, Leipzig (1922)Google Scholar
  14. 14.
    Thiele, T.: Extremalprobleme für Punktmengen. Master’s thesis, Freie Universität Berlin (1991)Google Scholar
  15. 15.
    Tutte, W.T.: Convex representations of graphs. Proceedings London Mathematical Society 10(38), 304–320 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Tutte, W.T.: How to draw a graph. Proceedings London Mathematical Society 13(52), 743–768 (1963)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Voss, K., Klette, R.: On the maximal number of edges of convex digital polygons included into a square. Počítače a umelá inteligencia 1(6), 549–558 (1982) (in Russian)zbMATHGoogle Scholar
  18. 18.
    Whiteley, W.: Motion and stresses of projected polyhedra. Structural Topology 7, 13–38 (1982)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Zickfeld, F.: Geometric and Combinatorial Structures on Graphs. Ph.D. thesis, Technical University Berlin (December 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Günter Rote
    • 1
  1. 1.Institut für InformatikFreie Universität BerlinBerlinGermany

Personalised recommendations