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
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2014 at 4:45 | comment | added | Igor Rivin | @TerronaBell yes, that is correct. | |
| Feb 9, 2014 at 22:36 | comment | added | TerronaBell | (E.g., in Figure 1 the extrinsic length of the arc will match the intrinsic length of the corresponding edge.) | |
| Feb 9, 2014 at 22:35 | comment | added | TerronaBell | Nice paper! But here the distance they consider is the geodesic rather than Euclidean distance induced by the embedding, no? | |
| Feb 9, 2014 at 3:08 | history | answered | Igor Rivin | CC BY-SA 3.0 |