We refer to a subset S of the surface of a convex solid C as geodesically convex if the shortest path along the surface of C joining any two points in S lies entirely within S (and if there are more than one such shortest paths, at least one such lies fully within S).
Question: Given a convex polyhedron P and an integer n. Without dismantling P, we need to mark out its surface into n equal area portions that are geodesically convex. Given P and n, an algorithm is needed to decide if P allows such a partition and if so, to find it.
The surface of a sphere can obviously be marked out into n geodesically convex equal area pieces for any n - by n great arcs that connect the poles. The surface of any axis-symmetric solid appears to allow division into n equal area geodesically convex pieces. However, I don't see how the surface of a regular tetrahedron can be given such a partition for n=5.