Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: minimum distance problem
Replies: 2   Last Post: Jul 10, 1996 11:31 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Paul MacKenzie

Posts: 2
Registered: 12/12/04
minimum distance problem
Posted: Jul 9, 1996 2:39 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply



Hi,

I was wondering if any computational geometrists out there can help me
with this one:

I have 2 line segments in R^3, both of which are defined by their end
points. I need to find the shortest line segment that joins the two, and
where on the two line segments this minimum length segment intersects.
If the 2 line segments intersect, then the intersection point should be
returned instead, along with a minimum distance of zero.

Is there an established solution to this problem, one that is relatively
fast to compute? I've checked through some computational geometry
texts, but they only talk about line segments in a plane, or convex
polytopes in R^3, neither of which is quite the case here.

Thanks,
Paul MacKenzie
pmackenz@crim.ca







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.