Let S be the surface of a 3D convex region (a 'convex surface'). Let S' be a subset of S. We shall refer to S' as geodetically convex in S if the following condition holds: If A and B are two points in S', (at least one of ) the shortest path(s) on S between A and B contains no point that is not in S'.
Question: It is easy to see that if S is the surface of a sphere and n is any integer, S can be partitioned into n equal area pieces that are also geodetically convex in S - these pieces are separated by great circle arcs between any 2 antipodal points on S. Prolate and oblate spheroids (and perhaps all surfaces got by rotating a curve about an axis) too seem to allow such equipartitions. Are there any other convex surfaces for which such an equipartition exists for any n? If so, how does one characterize such surfaces?
Note 1: If S is the surface of a cube, I suspect it cannot be cut into n geodetically convex equal area pieces for all n. One could also ask which convex surfaces are worst for such equipartitions - ie if there are convex surfaces which do not allow such an equipartition for any n.
Note 2: Even if we drop the equal area requirement and need the n pieces only to be geodetically convex in S, the question appears tricky for general n. For n=2, since a closed convex surface always has a closed geodesic (as per a theorem of Poincare), such a geodesic cuts a convex surface S into 2 pieces that are geodetically convex in S.