1. Define a 2D algorithm that finds the intersection point of two lines given in two-point form. The algorithm should be complete in that it handles all possible pairs of lines in the 2D plane.
2. Define a 2D algorithm that determines if two line segments intersect. If the line segments intersect, it should give their intersection point.
Do not use the algorithm given on the Web in lecture notes, but create your own by solving the simultaneous equations of the two lines.