2000 character limit reached
On Flat Polyhedra deriving from Alexandrov's Theorem
Published 13 Jul 2010 in cs.CG and cs.DM | (1007.2016v2)
Abstract: 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 whose gluings are specified by n labels.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
