Find Shortest Distance to Point on Ellipsoid

[golmschenk]

Right now I'm running this with a brute force program which takes points on an ellipsoid and checks the distance to the point, slightly readjusts, and keeps moving toward the minimum, but it takes far to long for the mass amount of points I want to run through the program. Is there an equation I can use to find the line?

The question more specifically is the following. I have the parameteric equation for an ellipsoid. I have the location of a point. I want to find the shortest distance from the surface of the ellipsoid to the point. The point could be on the inside or the outside of the ellipsoid. I currently have a brute force program solving this but would like an equation or something else cleaner/faster to solve this. Is there a better way I could be doing this? Thanks for your time.

 

[HallsofIvy]

Suppose the equation of the ellipsoid is
$$\frac{x^2}{a^2}+ \frac{y^2}{b^2}+ \frac{z^2}{c^2}= 1$$

Then the gradient at the point $(x_0,y_0, z_0)$ is
$$\frac{2}{a^2}x_0\vec{i}+ \frac{2}{b^2}y_0\vec{j}+ \frac{2}{c^2}y_0\vec{k}$$

The line through given point (u, v, w), parallel to that vector is
$$x= \frac{2}{a^2}x_0t+ u$$
$$y= \frac{2}{b^2}y_0t+ v$$
$$z= \frac{2}{c^2}z_0t+ w$$

Solve the three equations
$$x_0= \frac{2}{a^2}x_0t+ u$$
$$y_0= \frac{2}{b^2}y_0t+ v$$
$$z_0= \frac{2}{c^2}z_0t+ w$$
for $x_0$, $y_0$, and $z_0$ to find the point at which the shortest line (i.e. the perpendicular line) from the point intersects the ellipsoid, the find the distance between (u, v, w) and $(x_0, y_0, z_0)$.

 

[golmschenk]

Fantastic! Thanks! I knew there had to be something like this, but wasn't finding it.