CGAL users discussion list

["Vu, Khuong" <>]

I don't know much about cgal for 3D but we can have a solution for your 
question. 

Let 2 lines be d1 and d2.
1. find the plane (p) that contains the d1 and perpendicular to d2
2. the intersection of d2 with p is p2.
3. find the intersection (p1)of the line passing p1 and perpendicular to d1. 

It can be proved that p1p2 is the required line (segment).

Best,
Khuong
________________________________________
From: clemen 
[]
Sent: Friday, June 11, 2010 10:13 AM
To: 

Subject: [cgal-discuss] shortest line between two lines in 3d

simple problem: i have two lines/rays in 3d and want to get the shortest line
that connects both (or similarly: the 3d point that has the shortest
distance to both lines).

i can only find the intersect method but this fits just for a special case.
Anybody knows if cgal can help here?
--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/shortest-line-between-two-lines-in-3d-tp2251943p2251943.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss