Compute the shortest distance between the lines vec(r )=(hat(i) -hat(j)) + lambda (2hat(i) -hat(k)) " and " vec(r ) =(2hat(i) -hat(j)) + mu (hat(i) -
Compute the shortest distance between the lines
vec(r )=(hat(i) -hat(j)) + lambda (2hat(i) -hat(k)) " and " vec(r ) =(2hat(i) -hat(j)) + mu (hat(i) - hat(j) -hat(k))`
Determine whether these lines intersect of not.
16 views