A pseudopolynomial algorithm for Alexandrov's theorem
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 t...
Main Authors: | Kane, Daniel, Price, Gregory N., Demaine, Erik D. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Springer
2011
|
Online Access: | http://hdl.handle.net/1721.1/61985 https://orcid.org/0000-0003-3803-5703 |
Similar Items
-
A pseudopolynomial algorithm for Alexandrov's theorem
by: Price, Gregory Nathan
Published: (2009) -
Alexandrov's theorem revisited
by: Delgadino, MG, et al.
Published: (2019) -
Bubbling with L2-almost constant mean curvature and an Alexandrov-type theorem for crystals
by: Delgadino, MG, et al.
Published: (2018) -
Fast convergence of empirical barycenters in Alexandrov spaces and the Wasserstein space
by: Le Gouic, Thibaut, et al.
Published: (2022) -
Sharp spectral gap and Li-Yau's estimate on Alexandrov spaces
by: Qian, Z, et al.
Published: (2012)