Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 645-655 |
Journal | Journal of Global Optimization |
Volume | 50 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2011 |
Keywords
- Covering
- Simplex
- Spheres