The line segments might intersect but we don't want that point. It can be assumed that if the segments do intersect then they only intersect at the endpoints ie the intersection will not be in the middle of any segment. Cannot assume the problem can be solved, but it is a simple test to see if...
To further Clarify:
L1 has a range of values (x1,y1) to (x2,y2)
L2 has a range of values (x3,y3) to (x4,y4)
The points P1 and P2 have to fall into the range of their respective lines and the range does not contain the intersection of L1 and L2.
Yes, shortest distance greater than zero.
This is all in a 2-D plane. How is there more than one answer to the question? I think I've constrained it enough that there is only one answer.
L1 and L2 are not parallel, but that is a good point you bring up with the intersection point. I want the shortest distance between P1 and P2 that does not include the intersection point between L1 and L2.
Hello -
I need help finding collinear points:
Given:
Equations of 2 lines, L1 and L2
1 points, P3
Want to find points P1 and P2 that lie on L1 and L2 respectively that are collinear to P3. I know that there can be multiple combinations of points P1 and P2 so to narrow down the list...