> Does anyone know what the name of the algorithm would be for unfolding arbitrary polyhedra? AFAIK Shepard’s conjecture “every convex polyhedron has an unfold

> Does anyone know what the name of the algorithm would be for unfolding arbitrary polyhedra? AFAIK Shepard’s conjecture “every convex polyhedron has an unfolding without overlap” is still open, so I’m not sure that exists. Links you may or may not have seen: - https://en.wikipedia.org/wiki/Net_(polyhedron) https://en.wikipedia.org/wiki/Net_(polyhedron) - https://mathworld.wolfram.com/Unfolding.html https://mathworld.wolfram.com/Unfolding.html - http://web.york.cuny.edu/~malk/unfolding.html http://web.york.cuny.edu/~malk/unfolding.html