CGAL users discussion list

[Gärtner Bernd <>]

You could also write the rays/lines as linear (in)equality systems in 
different variable vectors x,y, and then use the quadratic programming solver 
to minimize the squared norm of x-y, see 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/QP_solver/Chapter_main.html
 
Best,
Bernd. 

________________________________

Von: clemen 
[mailto:]
Gesendet: Fr 6/11/2010 5:13
An: 

Betreff: [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