dc.contributor.author | Kane, Daniel | |
dc.contributor.author | Price, Gregory N. | |
dc.contributor.author | Demaine, Erik D. | |
dc.date.accessioned | 2011-03-28T20:29:25Z | |
dc.date.available | 2011-03-28T20:29:25Z | |
dc.date.issued | 2009-01 | |
dc.identifier.isbn | 978-3-642-03367-4 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/61985 | |
dc.description.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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Career award CCF-0347776) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Graduate Research Fellowship Program | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-03367-4_38 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | A pseudopolynomial algorithm for Alexandrov's theorem | en_US |
dc.type | Article | en_US |
dc.identifier.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 . | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Demaine, Erik D. | |
dc.contributor.mitauthor | Price, Gregory N. | |
dc.contributor.mitauthor | Demaine, Erik D. | |
dc.relation.journal | Algorithms and data structures (Conference) | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Kane, Daniel; Price, Gregory N.; Demaine, Erik D. | en |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |