Lecture Notes in Computer Science Volume 7034, 2012, pp 238-241

Realizing Planar Graphs as Convex Polytopes

* Final gross prices may vary according to local VAT.

Get Access

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.