Realizing Planar Graphs as Convex Polytopes

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

Abstract

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.

Keywords

Convex polytope spiderweb embedding 

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