Re: [Algorithms] Moving Segment vs Moving Point Intersection (2D)

[Jonathan B. <jo...@nu...>]

Jonathan Blow wrote:
>
> The first is, (assuming that things are moving linearly inside a 
> timestep), consider the point to be stationary, and just subtract its 
> velocity from the endpoints of the segment.  This simplifies the 
> equations. 

As I look at the final equation, I realize you don't even need to bother 
with this, so ignore that part.  You can just have a p(t) in the final 
equation I put down, and expand that into p0 + t delta p, and the 
equation is still just as easy to solve.  Sorry about the extra confusion.

So the only trick is testing against the full line, not just the segment.