MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose you have a 2-dimensional polyhedral surface with specified lengths for the edges so that the vertices all have positive curvature. I believe this has a unique isometric embedding into 3-dimensional Euclidean space as the boundary of a convex polyhedron. Could someone confirm this? If so, is there a reasonable algorithm for finding the isometric embedding computationally?

share|cite|improve this question
up vote 8 down vote accepted

Yes, this is the historically first version of the Alexandrov embedding theorem which was earlier discussed here. See the original Alexandrov's monograph (reviewed here), or see my book if you like downloadable stuff (at least for now).

The algorithmic issue is difficult. If you want the usual complexity, in my paper with Fedorchuk we showed that this requires finding roots of polynomials with exponential degrees. The practical algorithm (based on a new completely different proof of the Alexandrov theorem) was found by Bobenko and Izmestiev here and further analyzed here.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.