Minimum distance between two vectors on a graph?

[dan.g117]

Homework Statement

This is just a theoretical question so there aren't any values for the variables but there are two vectors with constant velocity. Given their velocity, magnitude, direction how can one calculate the minimum distance between the two vectors.

Also have to solve graphically

Homework Equations

The Attempt at a Solution

I'm currently under the assumption it has to do with slope or something along those lines.
Input greatly appreciated.

http://img22.imageshack.us/my.php?image=examplehr3.jpg

thanks!

 

[LowlyPion]

Welcome to PF.

Algebraically you can take the position difference vector as a function of time and determine the minimum.

Graphically ... just extending the line of action of position vectors doesn't seem to solve the problem you are asking about minimizing the position difference vector. A position graph alone doesn't really account for the rate of change of position as a function of time.