How Do You Solve a Skew Lines Distance Problem in Vector Geometry?

  • Thread starter Thread starter thepassenger48
  • Start date Start date
  • Tags Tags
    Geometry Vector
AI Thread Summary
To solve the skew lines distance problem, the goal is to find points Q and R on lines L1 and L2 such that the distance ||QR|| equals 2. The lines are defined by their parametric equations, and the closest distance between them has been calculated as sqrt(16/21), which is less than 2. This indicates that there are multiple pairs of points on the lines that can be 2 units apart. The discussion suggests exploring specific points of interest on the lines to achieve the desired distance. Understanding the geometry of the situation is crucial for identifying suitable points.
thepassenger48
Messages
13
Reaction score
0

Homework Statement


Given
Line1: (x,y,x)=(2,1,-1) + t(-1,0,2)
Line2: (x,y,x)=(1,1,3) + s(5,-6,-7)

The lines L1 and L2 are skew; determine points Q and R on lines L1 and L2 respectively such that ||QR|| = 2

2. The attempt at a solution
I have no idea how to even approach this question! Can someone give me a clue? Please

Thank you
 
Last edited:
Physics news on Phys.org
Do you know how to find the closest distance between the two lines? I attempted to do it and get sqrt(16/21) which is less than 2. This means, if you imagine the geometry, that there are immensely many points on the two lines that are distance 2 apart. Are there any two in particular that you are interested in?
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top