A pseudopolynomial algorithm for Alexandrov's theorem
Name
Demaine_A pseudopolynomial.pdf
Size
197.42 KB
Format
Adobe PDF
Checksum (MD5)
92ba1f3bcaf18597b5f6de9eeacbb5ac
Author(s)
Kane, Daniel
Price, Gregory N.
Demaine, Erik D.
Date Issued
January 2009
Journal
Algorithms and data structures (Conference)
Publisher
Springer
Citation
Kane, Daniel, Gregory N. Price and Erik D. Demaine, "A Pseudopolynomial Algorithm for Alexandrov’s Theorem" Algorithms and data structures (Lecture notes in computer science, v. 5664,2009)435-446. Copyright © 2009, Springer .
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-03367-4_38
