Steinitz Theorems for Orthogonal Polyhedra

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we find graph-theoretic characterizations of three classes of simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric projection in the plane with only one hidden vertex, xyz polyhedra, in which each axis-parallel line through a vertex contains exactly one other vertex, and arbitrary simple orthogonal polyhedra. In particular, the graphs of xyz polyhedra are exactly the bipartite cubic polyhedral graphs, and every bipartite cubic polyhedral graph with a 4-connected dual graph is the graph of a corner polyhedron. Based on our characterizations we find efficient algorithms for constructing orthogonal polyhedra from their graphs.Comment: 48 pages, 31 figure

In search for a perfect shape of polyhedra: Buffon transformation

For an arbitrary polygon consider a new one by joining the centres of consecutive edges. Iteration of this procedure leads to a shape which is affine equivalent to a regular polygon. This regularisation effect is usually ascribed to Count Buffon (1707-1788). We discuss a natural analogue of this procedure for 3-dimensional polyhedra, which leads to a new notion of affine $B$-regular polyhedra. The main result is the proof of existence of star-shaped affine $B$-regular polyhedra with prescribed combinatorial structure, under partial symmetry and simpliciality assumptions. The proof is based on deep results from spectral graph theory due to Colin de Verdiere and Lovasz.Comment: Slightly revised version with added example of pentakis dodecahedro