Skip to main content

performance tuning - Distance between two line segments in 3-space


I need to compute the distance between two line segments in a project. After googling, I found this algorithm and used it to implement a Mathematica version:


distSegToSeg[{p1_, p2_}, {q1_, q2_}] :=
Module[{small = 10^(-6), u, v, w,
a, b, c, d, e, D,
sc, sN, sD,
tc, tN, tD},

u = p2 - p1;
v = q2 - q1;
w = p1 - q1;
a = u.u;
b = u.v;
c = v.v;
d = u.w;
e = v.w;
D = a*c - b*b;
sD = D;

tD = D;
If[D < small,
sN = 0; sD = 1; tN = e; tD = c,
sN = b*e - c*d;
tN = (a*e - b*d);
If[sN < 0,
sN = 0.0; tN = e; tD = c,
If[sN > sD, sN = sD; tN = e + b; tD = c;]]];
If[tN < 0,
tN = 0;

If[-d < 0,
sN = 0,
If[-d > a,
sN = sD,
sN = -d; sD = a]],
If[tN > tD,
tN = tD;
If[-d + b < 0,
sN = 0,
If[-d + b > a,

sN = sD,
sN = -d + b; sD = a]]]];
sc = If[Norm[sN] < small, 0, sN/sD];
tc = If[Norm[tN] < small, 0, tN/tD];
N[Norm[w + sc*u - tc*v]]
]

The code is not in good Mathematica style, and it's very slow. Do you have any idea to make this faster? Do you have a better way to compute the distance between two line segments in 3D?



Answer



You can easily see that if the nearest approach of the two infinite lines does not fall within both segments then you must calculate the nearest distance of all four end points to the other segment.



 pointsegdis[{seg_, pointlist_}] := 
Module[{u = Subtract @@ seg, mean = Plus @@ seg/2},
{#, (mean - u Sign@# Min[1, Abs@#]/2) &@(-(2 ( # - mean).u )/u.u) } &
/@ pointlist ]
segsegdis[s1_, s2_] := Module[{u, v, w, d, t1, t2},
{u, v, w} = Subtract @@ # & /@ {Sequence @@ #, First /@ #} &@{s1, s2};
If[(d = u.u v.v - (v.u)^2) != 0 &&
Abs[t2 = 2 (u.u v.w - u.w v.u)/d + 1] <= 1 &&
Abs[t1 = 2 (v.u v.w - v.v u.w)/d + 1] <= 1,
Plus @@ (#[[1]] (1 + {1, -1} #[[2]] )) /2 & /@ {{s1, t1}, {s2, t2}} ,

First@SortBy[Flatten[pointsegdis /@ {{s1, s2}, {s2, s1}}, 1],
Total@((Subtract @@ #)^2) &]
] ] ;

{s1, s2} = RandomReal[{-1, 1}, {2, 2, 3}];
connect = segsegdis[s1, s2];
Graphics3D[{Line /@ {s1, s2}, {Red, Line[connect]}}]

enter image description here


This is several orders of magnitude faster than Minimise or FindMinimum



 testcases = RandomReal[{-1, 1}, {100, 2, 2, 3}];
(aa = Norm[ Subtract @@ segsegdis[#[[1]], #[[2]]] ] & /@ testcases) //Timing // First
(bb = First@
Minimize[{ Norm[(#[[1, 1]] (1 - t1)/2 + #[[1, 2]] (1 + t1)/2) -
(#[[2, 1]] (1 - t2)/2 + #[[2, 2]] (1 + t2)/2) ] ,
{-1<=t1 <= 1 , -1 <= t2 <= 1}}, {t1, t2}] & /@ testcases) // Timing //First
(cc = First@
FindMinimum[{
Norm[(#[[1, 1]] (1 - t1)/2 + #[[1, 2]] (1 + t1)/2) -
(#[[2, 1]] (1 - t2)/2 + #[[2, 2]] (1 + t2)/2) ] ,

{-1 <= t1 <= 1 , -1 <= t2 <= 1}}, {t1, t2}] & /@ testcases) // Timing // First


{0.015600, 12.620481, 2.714417}



verify all three give the same result to reasonable numerical precision


 Max[Abs[aa - bb]] -> 5.82532*10^-10
Max[Abs[aa - cc]] -> 2.25578*10^-6

Comments

Popular posts from this blog

plotting - Filling between two spheres in SphericalPlot3D

Manipulate[ SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, Mesh -> None, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], {n, 0, 1}] I cant' seem to be able to make a filling between two spheres. I've already tried the obvious Filling -> {1 -> {2}} but Mathematica doesn't seem to like that option. Is there any easy way around this or ... Answer There is no built-in filling in SphericalPlot3D . One option is to use ParametricPlot3D to draw the surfaces between the two shells: Manipulate[ Show[SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], ParametricPlot3D[{ r {Sin[t] Cos[1.5 Pi], Sin[t] Sin[1.5 Pi], Cos[t]}, r {Sin[t] Cos[0 Pi], Sin[t] Sin[0 Pi], Cos[t]}}, {r, 1, 2 - n}, {t, 0, Pi}, PlotStyle -> Yellow, Mesh -> {2, 15}]], {n, 0, 1}]

plotting - Plot 4D data with color as 4th dimension

I have a list of 4D data (x position, y position, amplitude, wavelength). I want to plot x, y, and amplitude on a 3D plot and have the color of the points correspond to the wavelength. I have seen many examples using functions to define color but my wavelength cannot be expressed by an analytic function. Is there a simple way to do this? Answer Here a another possible way to visualize 4D data: data = Flatten[Table[{x, y, x^2 + y^2, Sin[x - y]}, {x, -Pi, Pi,Pi/10}, {y,-Pi,Pi, Pi/10}], 1]; You can use the function Point along with VertexColors . Now the points are places using the first three elements and the color is determined by the fourth. In this case I used Hue, but you can use whatever you prefer. Graphics3D[ Point[data[[All, 1 ;; 3]], VertexColors -> Hue /@ data[[All, 4]]], Axes -> True, BoxRatios -> {1, 1, 1/GoldenRatio}]

plotting - Mathematica: 3D plot based on combined 2D graphs

I have several sigmoidal fits to 3 different datasets, with mean fit predictions plus the 95% confidence limits (not symmetrical around the mean) and the actual data. I would now like to show these different 2D plots projected in 3D as in but then using proper perspective. In the link here they give some solutions to combine the plots using isometric perspective, but I would like to use proper 3 point perspective. Any thoughts? Also any way to show the mean points per time point for each series plus or minus the standard error on the mean would be cool too, either using points+vertical bars, or using spheres plus tubes. Below are some test data and the fit function I am using. Note that I am working on a logit(proportion) scale and that the final vertical scale is Log10(percentage). (* some test data *) data = Table[Null, {i, 4}]; data[[1]] = {{1, -5.8}, {2, -5.4}, {3, -0.8}, {4, -0.2}, {5, 4.6}, {1, -6.4}, {2, -5.6}, {3, -0.7}, {4, 0.04}, {5, 1.0}, {1, -6.8}, {2, -4.7}, {3, -1.