Breaking glass optimally and Minkowski's problem for polytopes

Motivated by a study of least-action incompressible flows, we study all the ways that a given convex body in Euclidean space can break into countably many pieces that move away from each other rigidly at constant velocity, following geodesic motions in the sense of optimal transport theory. These we classify in terms of a countable version of Minkowski's geometric problem of determining convex polytopes by their face areas and normals. Illustrations involve various intriguing examples both fractal and paradoxical, including Apollonian packings and other types of full packings by smooth balls.