NP-completeness of a covering problem I was wondering about the complexity of the following covering problem. Let $B_i,\,i=1,\ldots,n$ be a set of unit disks in $\mathbb{R}^2$. The problem is to decide whether there exists $C\subset\{1,\ldots,n\}$ with $|C|\leq k$ such that $\bigcup_{i\in C} B_i = \bigcup_{i=1}^n B_i$. This could be considered as a continuous version of the geometric set cover problem. 
There is a paper that provides a constant approximation algorithm (Basappa et al, "Unit disk cover problem in 2D") but no proof of NP completeness has been provided. In this paper, the problem is referred to as the "rectangular region cover" problem. Also, in one version of the paper, they claim that the problem is NP-complete and they refer to Garey & Johnson but I could not find a proof there either. Computational complexity is far to my area of expertise so I do not want to reinvent the wheel by reproducing some well-known result. Any help will be greatly appreciated.
 A: The typical presentation of this problem is more like the following:

Given: A finite set of points $P$ and a set of unit disks $C$ in the plane
Question: Does there exist a subset $C' \subseteq C$ such that $|C'| \leq k$ and $P \subseteq \cup_{S \in C'} S$?

In this formulation, this problem is commonly known as DISCRETE UNION DISK COVER (DUDC). I believe the canonical reference for demonstrating that this problem is NP-complete is [1].
Note that in DUDC, $P$, the set of points to be covered, is given as finite. In the version proposed in this question, the set of points to be covered is given as $\cup_{S\in C} S$. In order to show that this version is NP-complete, we will need to demonstrate how some known NP-complete problem (either DUDC or otherwise) can be translated into this version. [A previous version of this answer had the conversion the wrong way around.]
EDITED TO ADD:
One other problem that seems related but not quite on the nose is DOMINATING SET IN DISK GRAPHS. It can be paraphrased as follows:

Given: A set of unit disks $C$ in the plane
Question: Does there exist a subset $C' \subseteq C$ such that $|C'| \leq k$ and for each $c \in C$ there exists $c' \in C'$ such that $c'$ intersects $c$?

I believe the original reference for the NP-completeness of this problem is [2] where it is referred to as "EUCLIDEAN m-CENTER ON POINTS".

*

*Fowler, Robert J., Michael S. Paterson, and Steven L. Tanimoto. "Optimal packing and covering in the plane are NP-complete." Information processing letters 12.3 (1981): 133-137


*Masuyama, Shigeru, Toshihide Ibaraki, and Toshiharu Hasegawa. "The computational complexity of the m-center problems on the plane." IEICE TRANSACTIONS (1976-1990) 64.2 (1981): 57-64.
