So we have four infinite lines, none mutually parallel(or else there is probably no solution). At some point in space, the distance(sum of the squares is fine) to each line is at minimum. For two lines its easy, Curve.ClosestPoints. Multiple lines, from all the online posts, requires solving a matrix. I am not against that, if someone can help a bit. I found a pretty good matlab program for it but its hard to translate to c#(python would be fine as well). I will probably use a math lib (math.net or accord.net) to do it once I understand how it works. Or if there really is a trick using some rhino methods that would be ideal…I don’t need super high speed for this…there will typically only be 4 lines.