Hello, I am C++ and Algorithm expert and interested in this project. Please let me know if you are interested.
Hello we can calculate it using following strategy
Suppose we have two line segments, each defined by two points. We want to know where the two lines intersect — even if the line segments do not intersect.
Translate the coordinate system so that end point of one line segment is now the origin, call this point A
Rotate the coordinate system so that other end point of same line is on the positive X-axis, call this point B
Thanks to linearity, the proportion of the large, vertical bracket to the smaller one must be exactly the same as the proportion of the large, horizontal bracket to the smaller one. This makes it easy to discover the point ABpos,0
Apply the value ABpos along the line A-B in the original coordinate system. This gives you the intersection point you wanted.
Regards
Anshu
Thank You