Is minimum distance between points on concentric ellipses constant? Given an ellipse, $E_1$ with radii $r_x, r_y$ I would like to know whether the minimum distance between any selected point, $P_a$, and $E_1$ is less than, say $D$.
I have seen the related question of finding the distance between a point and an ellipse. Rather than finding that minimum distance, I would like to solve it differently by creating an ellipse, $E_2$ with radii $r_x + D, r_y + D$ and then test whether the point $P_a$ falls within $E_2$, which is easy to do.
So, my question is, if the point $P_a$ falls within $E_2$, does it mean that the minimum distance between $E_1$ and $P_a$ is less than $D$?

For any point $p \in E_2$, the minimal distance between $p$ and $E_1$ is at most $D$.
For any point $p$ on $\partial E_2$, the boundary of ellipse $E_2$, one can find a
$\theta \in [0,2\pi)$ such that
$$p = (( r_x + D)\cos\theta, (r_y + D)\sin\theta)$$
Consider the corresponding point $q = (r_x \cos\theta, r_y \sin\theta)$ lying on $\partial E_1$, the boundary of ellipse $E_1$.
Since the distance between $p$ and $q$ is $D$, we have
$$\verb/dist/( p, E_1 ) = \inf \{ \verb/dist/(p,r) : r \in E_1 \} \le \verb/dist/(p,q) = D$$
So the minimum distance of $p$ from $E_1$ is at most $D$. The whole $\partial E_2$ is within a distance $D$ from $E_1$. 
Since $E_1$ is convex, so does the set of points within a distance $D$ from $E_1$. Since $E_2$ is convex and points inside $E_2$ lies on some line segment
ending at $\partial E_2$, every point on that line segment will be within a distance $D$ from $E_1$. This implies the whole $E_2$ is within a distance $D$ from $E_1$.
