All you'd need to do to is find a circle containing $n-1$ points, such that when you expand it so that it contains another point, there's a radius such that it will only contain that point
So, suppose we have $k$ points which are equidistant from our circle's center (and outside of our current circle, and are all the minimal distance away)
Consider each pair of points
Let's call these points $B,C$ WLOG
and let's call the center $A$
The set of points equidistant to $B$ and $C$ is a line through $A$
$A$ cannot lie on this line, since then we wouldn't have a unique point
Construct all lines for each pair of points, and you have a bunch of lines through $A$ which $A$ can't intersect
The reason I think that I'm allowed to move it around is because I could make it arbitrarily close to $A$
So, if there were any points very close to the boundary of the circle (that might be excluded), we can find some point very close to $A$ that will account for it.
King's son is lying dead, none to care for King's palace is grey with dust, none to clean it up Thousand lilies lying on the ground, none to pick them up
(It's a - sort of not very good - translation of a riddle I like a lot)