Timeline for Constructing a polyhedron of maximal possible volume from given bounds on areas of its faces
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 18, 2013 at 22:58 | comment | added | Liu Jin Tsai | @FridaMauer These questions may be related to yours: "Does every convex polyhedron have a combinatorially isomorphic counterpart whose all faces have rational areas?", "Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between edges are rational multiples of $\pi$?" | |
Nov 17, 2013 at 14:36 | comment | added | Joseph O'Rourke | The earlier question "Building a polyhedron from areas of its faces," is tangentially relevant (no attempt there to maximize volume). | |
Nov 17, 2013 at 4:15 | comment | added | Gerry Myerson | Perhaps this is what @Will had in mind, but I'd suggest starting by seeing what can be done for tetrahedra. | |
Nov 17, 2013 at 0:46 | comment | added | Joseph O'Rourke | It may be relevant that (counterintuitively!) the volume of any convex polyhedron can be increased by an isometric deformation to a nonconvex polyhedron. See "Inflating the cube without stretching". | |
Nov 16, 2013 at 22:45 | comment | added | Will Jagy | Perhaps you could edit in your results for your $4 \leq n \leq 8.$ | |
Nov 16, 2013 at 22:13 | review | First posts | |||
Nov 16, 2013 at 22:18 | |||||
Nov 16, 2013 at 21:54 | history | asked | Frida Mauer | CC BY-SA 3.0 |