Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining. (13th March 2014) - Cazals, F.
Abstract Choosing balls which best approximate a 3D object is a nontrivial 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<n balls defining a region FS⊂FO. This solution is further used to construct an outer approximation enclosing the initial shape, and an interpolated approximation sandwiched between the inner and outer approximations.