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

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

Yes, he actually pointed this out in a different email... it's one of 
those things where I saw it was a quadratic equation in the back of my 
head when I posted to gdalgorithms, but just didn't want to think about it.

Indeed you can have two intersections, due to the way the points are 
moving (I came up with a test case for that that's clear and obvious), 
so yeah, you just take the earliest (non-negative) answer.


Dave Moore wrote:
> Jonathan Blow wrote:
>> test against the whole line.  The point can only cross the line once 
>> during the timestep (due to linearity).  So if it crosses, then you find 
>
>   Small niggle: you get a quadratic equation in t not a linear one, 
> right?  There are cases where you get 2 crossings.
>
>
> -------------------------------------------------------
> This SF.Net email is sponsored by xPML, a groundbreaking scripting 
> language
> that extends applications into web and mobile media. Attend the live 
> webcast
> and join the prime developer group breaking into this new coding 
> territory!
> http://sel.as-us.falkag.net/sel?cmd=lnk&kid=110944&bid=241720&dat=121642
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
> Archives:
> http://sourceforge.net/mailarchive/forum.php?forum_id=6188
>