- #1
The Guardian
- 5
- 0
Sorry I wasn't sure which forum exactly to put this into.
I'm writing a computer game, and I have an object departing from 0,0 on a 2D plane with known and constant velocity and slope. X and Y will always be positive.
I also have a point on that plane with different but known (and constant) velocity.
What I'm not sure about is how to find the interception point that has the least amount of time. I know if I simply move on a perpendicular slope from the known X,Y coordinates it will be the shortest time for that object but not for the object traveling from 0,0 necessarily.
So basically I need the point at which the time for both objects to reach that point is the same.
Help please? :)
I'm writing a computer game, and I have an object departing from 0,0 on a 2D plane with known and constant velocity and slope. X and Y will always be positive.
I also have a point on that plane with different but known (and constant) velocity.
What I'm not sure about is how to find the interception point that has the least amount of time. I know if I simply move on a perpendicular slope from the known X,Y coordinates it will be the shortest time for that object but not for the object traveling from 0,0 necessarily.
So basically I need the point at which the time for both objects to reach that point is the same.
Help please? :)