On Flat Polyhedra deriving from Alexandrov's Theorem

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n3 ) time for polygons of n vertices.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Joseph O'Rourke
• Keywords: CORR 2010, Degenerate Flat Polyhedron, Education, Gluing, Straightforward Algorithm