I found out recently that whether or not every convex polyhedron has a net is an open problem. However, assuming that they do, I was wondering if there were particularly useful ideas that could reduce the time/cases to check to automatedly generate a net of a given convex polyhedron (whether the faces are all regular polygons).
To be clear, I understand that whether or not any search algorithm will actually terminate with a success is open but I wonder if there are easily computable properties of a edge-cut graph or something similar that allow you to check if a potential net will overlap with itself without having to abstractly draw it in the program and then check (or any other similar speedup).