Computer Science – Computational Geometry
Scientific paper
2010-07-13
Computer Science
Computational Geometry
6 pages, 2 figures
Scientific paper
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(n^3) time for polygons of n vertices.
No associations
LandOfFree
On Flat Polyhedra deriving from Alexandrov's Theorem 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 On Flat Polyhedra deriving from Alexandrov's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Flat Polyhedra deriving from Alexandrov's Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-350244