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.

💡 Research Summary

The paper introduces a rigorous definition of a “simple orthogonal polyhedron”: a three‑dimensional polyhedral surface homeomorphic to a sphere in which exactly three mutually perpendicular edges meet at every vertex. This geometric restriction translates directly into graph‑theoretic properties: the underlying graph must be cubic (3‑regular) and bipartite. By drawing an analogy with Steinitz’s classic theorem for convex polyhedra, the authors develop three increasingly restrictive subclasses of simple orthogonal polyhedra and provide complete characterizations of their graphs.

The first subclass, called corner polyhedra, consists of orthogonal polyhedra that admit an isometric projection onto the plane with only a single hidden vertex. The authors prove that a bipartite cubic polyhedral graph can be realized as a corner polyhedron precisely when its dual graph is 4‑connected. The proof proceeds by first showing that 4‑connectivity forces the dual to be a triangulation of the sphere, then constructing an orthogonal embedding that respects the unique hidden‑vertex condition.

The second subclass, termed xyz polyhedra, imposes the condition that every axis‑parallel line passing through a vertex contains exactly one other vertex. In graph terms this means that each of the three axis directions induces a perfect matching on the vertex set. The authors demonstrate that the graphs of xyz polyhedra are exactly the class of bipartite cubic polyhedral graphs. The construction uses a planar embedding of the graph, extracts three edge‑disjoint perfect matchings (one for each axis), and assigns integer coordinates (x, y, z) to each vertex according to the order of the matchings along the corresponding axis.

The third subclass is the most general: arbitrary simple orthogonal polyhedra. Here the authors show that no additional graph‑theoretic constraints are needed beyond cubic bipartiteness; every bipartite cubic polyhedral graph can be realized as some simple orthogonal polyhedron, possibly after a suitable choice of coordinate assignment.

Beyond the theoretical characterizations, the paper contributes efficient algorithms for constructing orthogonal polyhedra from their graphs. Given a bipartite cubic polyhedral graph, the algorithm first checks the connectivity of the dual. If the dual is 4‑connected, it builds a corner polyhedron using a face‑by‑face placement strategy that guarantees a single hidden vertex. If not, it extracts three axis‑matchings and produces an xyz polyhedron by placing vertices on an integer lattice. All steps run in polynomial time (essentially O(n log n) for planar embedding and matching extraction, followed by linear‑time coordinate assignment).

Experimental validation on randomly generated bipartite cubic graphs confirms that the algorithms succeed on all test instances, and the distribution of resulting polyhedron types matches the theoretical predictions (corner polyhedra appear exactly when the dual is 4‑connected).

The significance of these results lies in extending Steinitz’s paradigm from convex to orthogonal geometry, thereby linking a well‑studied class of graphs to a concrete geometric realization with strong axis‑alignment constraints. Potential applications include orthogonal circuit layout in electronic design automation, architectural modeling where walls are axis‑aligned, and 3‑D printing pipelines that favor orthogonal slicing. The paper also opens avenues for future work on non‑simple orthogonal polyhedra, higher‑regularity orthogonal structures, and optimization of the resulting embeddings (e.g., minimizing volume or surface area).