Intereting Posts

Solutions to $\lfloor x\rfloor\lfloor y\rfloor=x+y$
Calculate the lim $\lim_{x\to 1} \frac{ \sqrt{x} – 1}{\sqrt{x} – 1}$
Sum of truncated normals
Method of charactersitics and second order PDE.
$f(x)$ and $h(x)$ are absolutely continuous functions. Is $e^{f(x)} |h(x)|$ as well?
$2\times 2 $ matrices over $\mathbb{C}$ that satisfy $\mathrm A^3=\mathrm A$
Primes for >1 (good expression)
Equivalence of definitions of prime ideal in commutative ring
Left and right ideals of $R=\left\{\bigl(\begin{smallmatrix}a&b\\0&c \end{smallmatrix}\bigr) : a\in\mathbb Z, \ b,c\in\mathbb Q\right\}$
A proof by René Schilling that a continuous Lévy process is integrable
challenging alternating infinite series involving $\ln$
2011 AIME Problem 12 — Probability: 9 delegates around a round table
$l^p$ space not having inner product
Question about complete orthonormal basis
Every prime ideal of a finitely generated $\mathbb{R}$-algebra is an intersection of maximal ideals?

If given 2 lines $\alpha$ and $\beta$, ~~that are created by~~

- 2 points: A and B
- 2 plane intersection

I want to find shortest distance between them.

~~$$\left\{\begin{array}{c} P_1=x_1X+y_1Y+z_1Z+C=0 \\ P_2=x_2X+y_2Y+z_2Z+C=0\end{array}\right.$$~~

$$A=\left(x_3;y_3;z_3\right)$$

$$B=\left(x_4;y_4;z_4\right)$$

$$\alpha =n_1\times n_2=\left(\left|\begin{array}{cc} y_1 & z_1 \\ y_2 & z_2\end{array}\right|;-\left|\begin{array}{cc} x_1 & z_1 \\ x_2 & z_2\end{array}\right|;\left|\begin{array}{cc} x_1 & y_1 \\ x_2 & y_2\end{array}\right|\right)$$

$$\beta =$$

- How to find line parallel to direction vector and passing through a specific point?
- Formula to project a vector onto a plane
- What is the equation for a 3D line?
- How to find the vector equation of a plane given the scalar equation?
- Creating an ellipsoidal 3D surface
- Can the Surface Area of a Sphere be found without using Integration?

From here I tried:

The question of “shortest distance” is

only interesting in the skew case.

Let’s say $p_0$ and $p_1$ are points on the

lines $L_0$ and $L_1$, respectively. Also $d_0$

and $d_1$ are the direction vectors of $L_0$

and $L_1$, respectively. The shortest

distance is $(p_0 – p_1)$ * , in which *

is dot product, and is the normalized

cross product. The point on $L_0$ that is

nearest to $L_1$ is $p_0 + d_0(((p_1 – p_0) *

k) / (d_0 * k))$, in which $k$ is $d_1 \times d_0 \times d_1$.

Read more: http://wiki.answers.com/Q/If_the_shortest_distance_between_two_points_is_a_straight_line_what_is_the_shortest_distance_between_two_straight_lines#ixzz17fAWKFst

I tried, but failed.

- How to find the intersection of the area of multiple triangles
- Points on two skew lines closest to one another
- Finding equation of an ellipsoid
- How to divide a $3$ D-sphere into “equivalent” parts?
- The number of grid points near a circle.
- Proof of vector addition formula
- Conditions for intersection of parabolas?
- Determining the 3rd vertex of an Equilateral and Right angled isoceles triangle.
- Find normal vector of circle in 3D space given circle size and a single perspective
- Find a point on a line segment, located at a distance $d$ from one endpoint

Per this wikipedia article, if your lines are $\vec{X}=\vec{X_1}+t\vec{D_1}$ and $\vec{X}=\vec{X_2}+t\vec{D_2}$, the distance between them is $$\left|\frac{\vec{D_1}\times\vec{D_2}}{|\vec{D_1}\times\vec{D_2}|}\cdot(\vec{X_1}-\vec{X_2})\right|.$$

Say you have two lines $\vec L_1 = \vec X_1 + t\vec D_1$ and $\vec L_2 = \vec X_2 + t\vec D_2$.

Start with $(\vec X_1 – \vec X_2)$, which is a skew (non-perpendicular) segment from one line to the other. The distance from $\vec L_1$ to $\vec L_2$ is the component of $(\vec X_1 – \vec X_2)$ that is perpendicular to the lines $\vec L_1$ and $\vec L_2$. We can find this direction by taking the cross product $(\vec L_1 \times \vec L_2)$. After normalizing by dividing by the norm $|\vec L_1 \times \vec L_2|$, take the dot product with $(\vec X_1 – \vec X_2)$ to find the length of the component.

The distance is therefore

$$

\left|\frac{\vec{D_1}\times\vec{D_2}}{|\vec{D_1}\times\vec{D_2}|}\cdot(\vec{X_1}-\vec{X_2})\right| = \frac{\left|(\vec{D_1}\times\vec{D_2})\cdot(\vec{X_1}-\vec{X_2})\right|}{|\vec{D_1}\times\vec{D_2}|}.

$$

This is the best (quickest and most intuitive) method I’ve found so far:

Quick method to find line of shortest distance for skew lines

The idea is to consider the vector linking the two lines ($r, s$) in their generic points and then force the perpendicularity with both lines. (Call the line of shortest distance $t$)

This solution allows us to quickly get three results: The equation of the line of shortest distance between the two skew lines; the intersection point between t and s; the intersection point between t and r.

- Weighing Pool Balls where the number of balls is odd
- Evaluate $\int\frac{d\theta}{1+x\sin^2(\theta)}$
- Nilpotent infinitesimals comparison
- Prove that functions map countable sets to countable sets
- Setting Up an Integral to Find A Cone's Surface Area
- Critiques on proof showing $\sqrt{12}$ is irrational.
- Prove $\int_{0}^{\pi/2} x\csc^2(x)\arctan \left(\alpha \tan x\right)\, dx = \frac{\pi}{2}\left$
- Understanding the solution of a telescoping sum $\sum_{n=1}^{\infty}\frac{3}{n(n+3)}$
- Problem 6 – IMO 1985
- Arrangement of integers in a row such that the sum of every two adjacent numbers is a perfect square.
- Implementing Ornstein–Uhlenbeck in Matlab
- Strange definitions about basic probability – need clarification
- If a prime can be expressed as sum of square of two integers, then prove that the representation is unique.
- Sequence of Lipschitz functions
- Field Extension Notation