On determining the cover of a simplex by spheres centered at its vertices
L. G. Casado, I. García, Boglárka G.-Tóth, Eligius M. T. Hendrix · Journal of Global Optimization · 2010
The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices. We show that the SC problem is equivalent to a global optimization problem. We investigate its characteristics.