Part of the Lecture Notes in Computer Science book series (LNCS, volume 7034)
Realizing Planar Graphs as Convex Polytopes
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.
KeywordsConvex polytope spiderweb embedding
© Springer-Verlag Berlin Heidelberg 2012