Timeline for Is a convex polyhedron determined by its edge lengths and angular defects?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11 at 13:26 | history | edited | M. Winter | CC BY-SA 4.0 |
added 53 characters in body
|
| Oct 10 at 11:16 | history | edited | M. Winter | CC BY-SA 4.0 |
added 99 characters in body
|
| Mar 5 at 23:25 | comment | added | M. Winter | @PietroMajer The realization space of a 3-dimensional convex polyhedron is a manifold of dimension $|E|+6$ (Steinitz). Thus, in a perfect world, after factoring out the six trivial motions, specifying $|E|$-many parameters should suffice -- i.e. edge lengths. Unfortunately the world is not perfect and edge lengths are not sufficient (think of the cube). Still, from the perspective of counting DOFs, specifying the defects on all vertices feels like an overkill. But it is still not clear whether it suffices. | |
| Mar 5 at 23:07 | comment | added | RavenclawPrefect | @PietroMajer: One also knows the edge lengths, which impose additional constraints. For polyhedra with non-triangular faces, the planarity of the faces is an additional constraint not compatible with some assignments of edge lengths and face angles. (By Cauchy's rigidity theorem for convex polyhedra, we know the answer to the question in the post must be yes for triangular-faced polyhedra, even if we only have the edge lengths and not the defects!) | |
| Mar 5 at 23:03 | comment | added | Pietro Majer | Such a polyhedron with E edges has 2E angles to be determined. Sums of angles inside a face and sums of angles around a vertex are known.These make F+V=E+2 linear equations, which don't seem enough for determining 2E unknowns. Are there other relations that the angles must satisfy? | |
| Mar 5 at 21:04 | history | edited | M. Winter | CC BY-SA 4.0 |
added 12 characters in body
|
| Mar 5 at 20:50 | comment | added | M. Winter | @RavenclawPrefect Yes, you can assume that the combinatorics of the polyhedron is given. | |
| Mar 5 at 20:49 | comment | added | RavenclawPrefect | I assume you want the edge lengths and angular defects to come with associated combinatorial incidence data (ie which edges connect which vertices), rather than determining the polyhedron solely by the multiset of such lengths and defects? | |
| Mar 5 at 18:37 | history | edited | M. Winter | CC BY-SA 4.0 |
deleted 19 characters in body
|
| Mar 5 at 18:32 | history | edited | M. Winter | CC BY-SA 4.0 |
deleted 19 characters in body
|
| Mar 5 at 18:13 | history | edited | M. Winter | CC BY-SA 4.0 |
added 145 characters in body
|
| Mar 5 at 18:07 | history | asked | M. Winter | CC BY-SA 4.0 |