A Pseudopolynomial Algorithm for Alexandrov’s Theorem
- Cite this paper as:
- Kane D., Price G.N., Demaine E.D. (2009) A Pseudopolynomial Algorithm for Alexandrov’s Theorem. In: Dehne F., Gavrilova M., Sack JR., Tóth C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the polyhedron to arbitrary precision given the metric, and prove a pseudopolynomial bound on its running time.
Unable to display preview. Download preview PDF.