This advanced article on intersection tests is primarily about curve intersection, but it also contains useful information for primitive intersection tests, such as point-line, line-line, and ...

When I use my current algorithm, I get an intersection point that isn't even in the bounding box of either of these lines. Here is the code I'm using: Code: const double x1 = 2089426.5233462777; const ...

Line-sphere intersection is just like line-circle intersection. Algebraically, a sphere is also a degree-2 polynomial, and Bezout's theorem says we will still only get 2 intersections.