Let l be the line in space through the points $(0, 0, 1)$ and $(1, 1, 1)$. What is the length of the shortest possible path that begins at the origin, travels to a point on $l$, then ends at the point $(1, 0, 0)$?
So I've recently encountered this problem about the shortest path between this line and points in a 3D graph. So far, I'm tried to simplify the line into the same plane as the two points (making it just a 2D graph). But so far, I haven't been able to find a way to do that. I've tried shifting the line downwards and moving it one unit along the x-axis, but I just haven't been able to find a way to do it. Does anyone have any ideas?
This is only an overview to the answer. Look at the picture
Suppose $A=(1,0,0)$, $B$ is the middle of $(0,0,1)$ and $(1,1,1)$, and our route is $O\rightarrow P\rightarrow A$. We want to minimize $|OP|+|PA|$.
Point $A’$ is located vertically above $B$ such that $|BA|=|BA’|$. As a consequence, $|PA|=|PA’|$.
The segment $OA'$ intersect $l$ at $Q$.
Now, minimizing $|OP|+|PA|$ is equivalent to minimizing $|OP|+|PA’|$.
Triangle inequality: $|OP|+|PA’|\geq|OA’|$. The shortest route is $O\rightarrow Q\rightarrow A$. I will leave calculating $|OA’|$ to you.