2026-09-20T20:47:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/447382022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Eric D. Demaine.
Price, Gregory Nathan
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2009-03-16T19:36:27Z
2009-03-16T19:36:27Z
2008
2008
http://hdl.handle.net/1721.1/44738
298258979
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 43-44).
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.
by Gregory Nathan Price.
S.M.
44 p.
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
A pseudopolynomial algorithm for Alexandrov's theorem
pseudopolynomial-time construction for Alexandrov's theorem
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f7834dae-a376-4d44-afad-90bd521f47ca">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A pseudopolynomial algorithm for Alexandrov's theorem</Title>
<Subtitle>pseudopolynomial-time construction for Alexandrov's theorem</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2008</PublicationDate>
<Authors>
<Author>
<DisplayName>Price, Gregory Nathan</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>