A near-quadratic algorithm for the alpha-connected two-center decision problem

We consider the problem of deciding if a set of points can be covered by two discs with centers p and q and common radius r such that the ratio d(p; q)=r is bounded below by a user supplied constant ff. We also present an O(n n) algorithm for this problem.