Timeline for How hard is it to determine if a weighted graph can be isometrically embedded in R^3?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2014 at 2:01 | comment | added | TerronaBell | P.S. Yes, I mean a triangulated surface. | |
| Feb 9, 2014 at 1:59 | comment | added | TerronaBell | Thanks Joseph. Yes, these kinds of finite isometries do come to mind, though I don't yet have much intuition for whether they make it hard to find just one isometric embedding. From an optimization point of view: if the surface is infinitesimally rigid then any objective function with zeros only at isometric embeddings must be nonconvex (the zeros are isolated). But to answer the existence question, one may need only ski downhill to the bottom of a single valley... | |
| Feb 9, 2014 at 1:22 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |