Is this covering problem NP-hard?
If I arrange the disks into a spiral pattern then the problem is NP-hard. It may be even harder in your general case. This would be a variation on the polygon covering problem.

See https://en.wikipedia.org/wiki/Polygon_covering