Steinitz Theorems for Orthogonal Polyhedra

Details Steinitz Theorems for Orthogonal Polyhedra Steinitz Theorems for Orthogonal Polyhedra

2009-12-02

arxiv.org/abs/0912.0537v1

Computer Science

Computational Geometry

48 pages, 31 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Steinitz Theorems for Orthogonal Polyhedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Steinitz Theorems for Orthogonal Polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Steinitz Theorems for Orthogonal Polyhedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516416