This is a very lucid exposition BUT... I have a question. It is clear that you can remove a face of a cube and then flatten it to get a planar graph. But suppose your polyhedron had every face a legitimate polygon but is very spiky and complicated with all sorts of ins and outs but no holes or tunnels. How can you guarantee that your algorithm for flattening the polyhedron to an equivalent planar graph still works?

This question is for testing whether you are a human visitor and to prevent automated spam submissions.