I wish you hadn't said that. Now I'm thinking about convex-apple-cutting algorithms and theorems about edible apple maximization instead of the several things I'm supposed to be doing.

(I tentatively conclude that there's a unique convex hull that minimally encloses any given core, regardless of geometry, but that it is not necessarily reachable in a finite number of cuts.)