Simple: If I have two lines which meet at one end how can I detect that they touch?
All the line intersection algorithms that I've seen do not detect this scenario.
My specific problem is testing one line against a list of lines. The intersection which fails is when the intersecting line crosses the end point of one of the lines. For example, when the list of lines are a series of lines connected by their endpoints, the intersecting line does not generate a intersect detection for the connection point.
By 'touch' I mean where the very end of one line intersects the length of another.
I'm not sure of the names of the algorithms I've used, but they are mostly from stackoverflow: Efficient maths algorithm to calculate intersections Algorithm for intersection of 2 lines? How do you detect where two line segments intersect?