Join
Dürer's problem: edge-unfolding convex polyhedra
Prove that every convex polyhedron can be cut along its edges and unfolded flat in one piece without overlap, or find one that cannot.
Prove that every convex polyhedron can be cut along its edges and unfolded flat in one piece without overlap, or find one that cannot.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.