A pseudopolynomial algorithm for Alexandrov's theorem
Name
298258979-MIT.pdf
Description
Full printable version
Size
1.68 MB
Format
Adobe PDF
Checksum (MD5)
689b04a2ed74d5d7561e563832b0cda6
Author(s)
Price, Gregory Nathan
Advisor(s)
Eric D. Demaine.
Alternative Title
pseudopolynomial-time construction for Alexandrov's theorem
Date Issued
2008
Publisher
Massachusetts Institute of Technology
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 given the metric, and prove a pseudopolynomial bound on its running time. This is joint work with Erik Demaine and Daniel Kane.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 43-44).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
