Small grid embeddings of 3-polytopes (2009)
Mor, Ares Ribó, Rote, Günter, Schulz, André
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$. If the...
Ares Ribó Mor, Graph Algorithms
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(2 7.55n). The crucial part is the construction of a...