3D Geometry: Speed-Solving Techniques (10)

easy 2 min read

Question

Find the shortest distance between the lines r1=i^+2j^+3k^+λ(2i^+3j^+4k^)\vec{r}_1 = \hat{i} + 2\hat{j} + 3\hat{k} + \lambda(2\hat{i} + 3\hat{j} + 4\hat{k}) and r2=2i^+4j^+5k^+μ(3i^+4j^+5k^)\vec{r}_2 = 2\hat{i} + 4\hat{j} + 5\hat{k} + \mu(3\hat{i} + 4\hat{j} + 5\hat{k}).

Solution — Step by Step

a1=i^+2j^+3k^\vec{a}_1 = \hat{i} + 2\hat{j} + 3\hat{k}, b1=2i^+3j^+4k^\vec{b}_1 = 2\hat{i} + 3\hat{j} + 4\hat{k}

a2=2i^+4j^+5k^\vec{a}_2 = 2\hat{i} + 4\hat{j} + 5\hat{k}, b2=3i^+4j^+5k^\vec{b}_2 = 3\hat{i} + 4\hat{j} + 5\hat{k}

b1×b2=i^j^k^234345=i^(1516)j^(1012)+k^(89)=i^+2j^k^\vec{b}_1 \times \vec{b}_2 = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 2 & 3 & 4 \\ 3 & 4 & 5 \end{vmatrix} = \hat{i}(15-16) - \hat{j}(10-12) + \hat{k}(8-9) = -\hat{i} + 2\hat{j} - \hat{k}

Magnitude: b1×b2=1+4+1=6|\vec{b}_1 \times \vec{b}_2| = \sqrt{1 + 4 + 1} = \sqrt{6}.

a2a1=i^+2j^+2k^\vec{a}_2 - \vec{a}_1 = \hat{i} + 2\hat{j} + 2\hat{k}.

(a2a1)(b1×b2)=(1)(1)+(2)(2)+(2)(1)=1+42=1(\vec{a}_2 - \vec{a}_1) \cdot (\vec{b}_1 \times \vec{b}_2) = (1)(-1) + (2)(2) + (2)(-1) = -1 + 4 - 2 = 1

d=(a2a1)(b1×b2)b1×b2=16=66d = \frac{|(\vec{a}_2 - \vec{a}_1) \cdot (\vec{b}_1 \times \vec{b}_2)|}{|\vec{b}_1 \times \vec{b}_2|} = \frac{1}{\sqrt{6}} = \frac{\sqrt{6}}{6}

Final answer: d=16d = \dfrac{1}{\sqrt{6}} units

Why This Works

The vector b1×b2\vec{b}_1 \times \vec{b}_2 is perpendicular to both lines. Projecting the connecting vector a2a1\vec{a}_2 - \vec{a}_1 onto this perpendicular direction gives the shortest distance.

If b1×b2=0\vec{b}_1 \times \vec{b}_2 = 0, the lines are parallel and you need a different formula. If the scalar triple product is zero (lines coplanar), distance is zero — they intersect.

Alternative Method

Set up a perpendicular condition: find λ,μ\lambda, \mu such that the vector between corresponding points is perpendicular to both direction vectors. Solving two linear equations in λ,μ\lambda, \mu gives the foot of perpendicular on each line. Slower but more conceptual.

Common Mistake

Students forget the absolute value in the numerator. The dot product can be negative depending on orientation, but distance is always positive. Always wrap with |\cdot|.

Before computing the distance, check whether the lines are skew. If (a2a1)(b1×b2)=0(\vec{a}_2 - \vec{a}_1) \cdot (\vec{b}_1 \times \vec{b}_2) = 0, lines intersect (distance 0). Saves time.

Want to master this topic?

Read the complete guide with more examples and exam tips.

Go to full topic guide →

Try These Next