An example of finding the shortest distance between two lines in 3D space which do not intersect.
The lines are specified only by a point on them and their direction vectors, and from this general points on each line are established in terms of parameters.
The resulting vector from one point to the other then leads to the parameters of the points required and the distance between them.
The same general vector would give the point of intersection if its components could form the zero vector.
29 авг 2024