Optimize pairings of two types of points with respect to the maximum distance inside any pair

Question

I\'m trying to find an efficient algorithm for the following problem: Given two different sets, both of size N. Each element in the two sets has coordinates (x,y). The task