Algorithmic problems in geometry often become tractable with the assumption of convexity. Optimization, volume computation, geometric learning and finding the centroid are all examples of problems that are significantly easier for convex sets. One of the most powerful results in Convex Geometry is the so-called Brunn-Minkowski theorem. It plays a very important role as much in the theoretical framework of geometric inequalities as well as in applied contexts. For instance in crystallography, where it is used to show the mathematical interpretation of the Gibbs-Curie principle (the equilibrium shape of the crystal minimizes the surface energy among all sets of the same volume); or in order to ensure the concavity of the objective function in...