Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse-Graining

AbstractChoosing balls that best approximate a 3D object is a non-trivial problem. To answer it, we first address the inner approximation problem, which consists of approximating an object FO defined by a union of n balls with k