(adsbygoogle = window.adsbygoogle || []).push({}); 0. Background

I am a Doctoral student studying Geographic Information Science. I do a good bit of programming during the course of my work. Recently, I happened upon a problem which I cannot solve on my own (my post-calc math comfort zone is mostly in procedure and repetition, not in formulating new approaches to unseen problems; also, I've forgotten important bits of it). This problem arose as I was working on a statistical analysis package for spatial data.

I am a first time reader and poster, and apologize in advance for any faux pas I may commit out of ignorance.

1. The problem statement, all variables and given/known data

The statistical software component I am developing needs to calculate the distance between two line segments. Not the absolute distance, as that is trivial. In these data, the x and y dimensions represent space and the z dimension is time (t). The distance must be in terms of space, not of time, meaning that for any point (x,y,t) on the first line distance can only be measured to a single point (x2,y2,t) on the second line (obviously where t=t).

2. Relevant equations

None given that I didn't derive myself; as I mentioned, this is not a homework problem per say, but rather a problem encountered in the course of separate research.

3. The attempt at a solution

I've taken enough calculus to know that there lies a solution therein. I can, in theory, derive two parabolas on a 2d plane whose distance corresponds to the distance between the two line segments, and then break out a little calculus and solve it. There are two problems with this approach. First, I don't know how to form a translation that will stretch a curved plane (between two skew lines, i think its what they're called) and flatten it while maintaining its properties (thereby translating the two straight line segments into parabolas). I don't even have the correct math vocabulary to explain that understandably. Second, calculus rarely translates well into a computing environment, so that's a dead end I fear.

I'm hoping there is a linear algebra / matrix-related solution to my problem.

In my pursuit of this I have formulated the problem as follows:

I start with four points in 3-space:

(F_{x}(t_{0}), F_{y}(t_{0}), t_{0}),

(F_{x}(t_{2}), F_{y}(t_{2}), t_{2}),

(G_{x}(t_{1}), G_{y}(t_{1}), t_{1}),

(G_{x}(t_{3}), G_{y}(t_{3}), t_{3}),

where

t0 <= t_{1}< t_{2}<= t_{3}

and

F_{x}(t) = A_{fx}t + B_{fx}for t in (t_{0}, t_{2})

F_{y}(t) = A_{fy}t + B_{fy}for t in (t_{0}, t_{2})

G_{x}(t) = A_{gx}t + B_{gx}for t in (t_{1}, t_{3})

G_{y}(t) = A_{gy}t + B_{gy}for t in (t_{1}, t_{3})

where A_{fx}, B_{fx}, A_{fy}, B_{fy}, A_{gx}, B_{gx}, A_{gy}and B_{gy}are constants.

Minimize ( (F_{x}(t) - G_{x}(t))^{2}+ (F_{y}(t) - G_{y}(t))^{2})^{0.5}over t in (t_{1}, t_{2})

To explain this, I have 'projected' the two line segments onto the x,t and y,t planes, and derived a general expression for each as a function of t. But now that I have my fancy formulation, I haven't the faintest idea where to go from here. Even a keyword would help me, as I am (obviously) deficient in appropriate math vocabulary.

Anyway, I greatly appreciate any help or suggestions I can get; thanks in advance!

- Scott

**Physics Forums - The Fusion of Science and Community**

# 2D Distance between 3D line segments

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: 2D Distance between 3D line segments

Loading...

**Physics Forums - The Fusion of Science and Community**