Efficient Algorithm to Find the Closest Points of Two Sets

42 Views Asked by At

Let's assume there are two sets $R$ and $B$ with each having $n$ points in the plane. Is there an Algorithm with $\Theta(n \log n)$ that can find points $r$ and $b$ with minimal distance such that $r \in R$ and $b \in B$?