Line–line intersection

In Euclidean geometry, the intersection of a line and a line can be the empty set, a point, or another line. Distinguishing these cases and finding the intersection have uses, for example, in computer graphics, motion planning, and collision detection.

In three-dimensional Euclidean geometry, if two lines are not in the same plane, they have no point of intersection and are called skew lines. If they are in the same plane, however, there are three possibilities: if they coincide (are not distinct lines), they have an infinitude of points in common (namely all of the points on either of them); if they are distinct but have the same slope, they are said to be parallel and have no points in common; otherwise, they have a single point of intersection.

The distinguishing features of non-Euclidean geometry are the number and locations of possible intersections between two lines and the number of possible lines with no intersections (parallel lines) with a given line.

Formulas

A necessary condition for two lines to intersect is that they are in the same plane—that is, are not skew lines. Satisfaction of this condition is equivalent to the tetrahedron with vertices at two of the points on one line and two of the points on the other line being degenerate in the sense of having zero volume. For the algebraic form of this condition, see .

Given two points on each line

First we consider the intersection of two lines and in two-dimensional space, with line being defined by two distinct points and , and line being defined by two distinct points and .

The intersection of line and can be defined using determinants.

:$P_x = \frac \,\! \qquad P_y = \frac \,\!$

The determinants can be written out as:

:
\begin
P_x&= \frac
\\ pxP_y&= \frac
\end

When the two lines are parallel or coincident, the denominator is zero. If the lines are almost parallel, then a computer solution might encounter numeric problems implementing the solution described above: the recognition of this condition might require an approximate test in a practical application. An alternate approach might be to rotate the line segments so that one of them is horizontal, whence the solution of the rotated parametric form of the second line is easily obtained. Careful discussion of the special cases is required (parallel or coincident lines, overlapping or non-overlapping intervals).

Given two points on each line segment

Note that the intersection point above is for the infinitely long lines defined by the points, rather than the line segments between the points, and can produce an intersection point not contained in either of the two line segments. In order to find the position of the intersection in respect to the line segments, we can define lines and in terms of first degree Bézier parameters:

: $L_1 = \beginx_1 \\ y_1\end + t \beginx_2-x_1 \\ y_2-y_1\end, \qquad L_2 = \beginx_3 \\ y_3\end + u \beginx_4-x_3 \\ y_4-y_3\end$

(where and are real numbers). The intersection point of the lines is found with one of the following values of or , where

: $t = \frac = \frac$
and
: $u = \frac = \frac,$
with
: $(P_x, P_y)= \bigl(x_1 + t (x_2-x_1),\; y_1 + t (y_2-y_1)\bigr) \quad \text \quad (P_x, P_y) = \bigl(x_3 + u (x_4-x_3),\; y_3 + u (y_4-y_3)\bigr)$

There will be an intersection if and . The intersection point falls within the first line segment if , and it falls within the second line segment if . These inequalities can be tested without the need for division, allowing rapid determination of the existence of any line segment intersection before calculating its exact point.

Given two line equations

The and coordinates of the point of intersection of two non-vertical lines can easily be found using the following substitutions and rearrangements.

Suppose that two lines have the equations and where and are the slopes (gradients) of the lines and where and are the -intercepts of the lines. At the point where the two lines intersect (if they do), both coordinates will be the same, hence the following equality:

:$ax+c = bx+d.$

We can rearrange this expression in order to extract the value of ,

:$ax-bx = d-c,$
and so,
:$x = \frac.$

To find the coordinate, all we need to do is substitute the value of into either one of the two line equations, for example, into the first:

:$y = a\frac+c.$

Hence, the point of intersection is
:$P = \left( \frac, a\frac+c \right) .$
Note if then the two lines are parallel. If as well, the lines are different and there is no intersection, otherwise the two lines are identical and intersect at every point.

Using homogeneous coordinates

By using homogeneous coordinates, the intersection point of two implicitly defined lines can be determined quite easily. In 2D, every point can be defined as a projection of a 3D point, given as the ordered triple . The mapping from 3D to 2D coordinates is . We can convert 2D points to homogeneous coordinates by defining them as .

Assume that we want to find intersection of two infinite lines in 2-dimensional space, defined as and . We can represent these two lines in line coordinates as and . The intersection of two lines is then simply given by

:$P' = (a_p, b_p, c_p) = U_1 \times U_2 = (b_1 c_2 - b_2 c_1, a_2 c_1-a_1 c_2, a_1 b_2 - a_2 b_1)$

If , the lines do not intersect.

More than two lines

The intersection of two lines can be generalized to involve additional lines. The existence of and expression for the -line intersection problem are as follows.

In two dimensions

In two dimensions, more than two lines almost certainly do not intersect at a single point. To determine if they do and, if so, to find the intersection point, write the th equation () as

:$\begin a_ & a_ \end \begin x \\ y \end = b_i,$

and stack these equations into matrix form as

:$\mathbf\mathbf=\mathbf,$

where the th row of the matrix is , is the 2 × 1 vector , and the th element of the column vector is . If has independent columns, its rank is 2. Then if and only if the rank of the augmented matrix is also 2, there exists a solution of the matrix equation and thus an intersection point of the lines. The intersection point, if it exists, is given by

:$\mathbf = \mathbf^\mathrm \mathbf = \left(\mathbf^\mathsf \mathbf\right)^ \mathbf^\mathsf \mathbf,$

where is the Moore–Penrose generalized inverse of (which has the form shown because has full column rank). Alternatively, the solution can be found by jointly solving any two independent equations. But if the rank of is only 1, then if the rank of the augmented matrix is 2 there is no solution but if its rank is 1 then all of the lines coincide with each other.

In three dimensions

The above approach can be readily extended to three dimensions. In three or more dimensions, even two lines almost certainly do not intersect; pairs of non-parallel lines that do not intersect are called skew lines. But if an intersection does exist it can be found, as follows.

In three dimensions a line is represented by the intersection of two planes, each of which has an equation of the form

:$\begin a_ & a_ & a_ \end \beginx \\ y \\ z\end = b_i.$

Thus a set of lines can be represented by equations in the 3-dimensional coordinate vector :

:$\mathbf\mathbf=\mathbf$

where now is and is . As before there is a unique intersection point if and only if has full column rank and the augmented matrix does not, and the unique intersection if it exists is given by

:$\mathbf = \left(\mathbf^\mathsf \mathbf \right)^ \mathbf^\mathsf \mathbf.$

Nearest points to skew lines

In two or more dimensions, we can usually find a point that is mutually closest to two or more lines in a least-squares sense.

In two dimensions

In the two-dimensional case, first, represent line as a point on the line and a unit normal vector , perpendicular to that line. That is, if and are points on line 1, then let and let

:$\mathbf_1:= \begin 0 & -1 \\ 1 & 0 \end \frac$

which is the unit vector along the line, rotated by a right angle.

Note that the distance from a point to the line is given by

:$d\bigl(\mathbf,(\mathbf,\mathbf)\bigr) = \bigl, (\mathbf-\mathbf)\cdot \mathbf\bigr, = \left, (\mathbf-\mathbf)^\mathsf \mathbf\ = \left, \mathbf ^\mathsf (\mathbf-\mathbf)\ = \sqrt.$

And so the squared distance from a point to a line is

:$d\bigl(\mathbf,(\mathbf,\mathbf)\bigr)^2 = (\mathbf-\mathbf)^\mathsf \left(\mathbf \mathbf^\mathsf \right) (\mathbf-\mathbf).$

The sum of squared distances to many lines is the cost function:

:$E(\mathbf) = \sum_i (\mathbf-\mathbf_i)^\mathsf \left(\mathbf_i \mathbf_i^\mathsf\right) (\mathbf-\mathbf_i).$

This can be rearranged:

:$\begin E(\mathbf) & = \sum_i \mathbf^\mathsf \mathbf_i \mathbf_i^\mathsf \mathbf - \mathbf^\mathsf \mathbf_i \mathbf_i^\mathsf \mathbf_i - \mathbf_i^\mathsf \mathbf_i \mathbf_i^\mathsf \mathbf + \mathbf_i^\mathsf \mathbf_i \mathbf_i^\mathsf \mathbf_i \\ & = \mathbf^\mathsf \left(\sum_i \mathbf_i \mathbf_i^\mathsf\right) \mathbf - 2 \mathbf^\mathsf \left(\sum_i \mathbf_i \mathbf_i^\mathsf \mathbf_i\right) + \sum_i \mathbf_i^\mathsf \mathbf_i \mathbf_i^\mathsf \mathbf_i. \end$

To find the minimum, we differentiate with respect to and set the result equal to the zero vector:

:$\frac = \boldsymbol = 2 \left(\sum_i \mathbf_i \mathbf_i^\mathsf\right) \mathbf - 2 \left(\sum_i \mathbf_i \mathbf_i^\mathsf \mathbf_i\right)$

so

:$\left(\sum_i \mathbf_i \mathbf_i^\mathsf\right) \mathbf = \sum_i \mathbf_i \mathbf_i^\mathsf \mathbf_i$

and so

:$\mathbf = \left(\sum_i \mathbf_i \mathbf_i^\mathsf\right)^ \left(\sum_i \mathbf_i \mathbf_i^\mathsf \mathbf_i\right).$

In more than two dimensions

While is not well-defined in more than two dimensions, this can be generalized to any number of dimensions by noting that is simply the symmetric matrix with all eigenvalues unity except for a zero eigenvalue in the direction along the line providing a seminorm on the distance between and another point giving the distance to the line. In any number of dimensions, if is a unit vector ''along'' the th line, then

: $\mathbf_i \mathbf_i^\mathsf$ becomes $\mathbf - \mathbf_i \mathbf_i^\mathsf$

where is the identity matrix, and so

: $x= \left(\sum_i \mathbf-\mathbf_i \mathbf_i^\mathsf\right)^ \left(\sum_i \left(\mathbf-\mathbf_i \mathbf_i^\mathsf \right) \mathbf_i\right).$

General derivation

In order to find the intersection point of a set of lines, we calculate the point with minimum distance to them. Each line is defined by an origin and a unit direction vector . The square of the distance from a point to one of the lines is given from Pythagoras:

: $d_i^2 = \left\, \mathbf - \mathbf_i \right\, ^2 - \left( \left( \mathbf - \mathbf_i \right)^\mathsf \mathbf_i \right)^2 = \left( \mathbf - \mathbf_i \right)^\mathsf \left( \mathbf - \mathbf_i \right) - \left( \left( \mathbf - \mathbf_i \right)^\mathsf \mathbf_i \right)^2$
where is the projection of on line . The sum of distances to the square to all lines is

: $\sum_i d_i^2 = \sum_i \left( \left( \mathbf- \mathbf_i \right)- \right)$

To minimize this expression, we differentiate it with respect to .

: $\sum_i \left( 2\left( \mathbf - \mathbf_i \right)- 2 \left(\left( \mathbf - \mathbf_i \right)^\mathsf \mathbf_i\right) \mathbf_i\right)=\boldsymbol$

: $\sum_i \left( \mathbf - \mathbf_i \right) = \sum_i \left( \mathbf_i \mathbf_i^\mathsf \right) \left( \mathbf - \mathbf_i \right)$

which results in

: $\left(\sum_i\left(\mathbf - \mathbf_i \mathbf_i^\mathsf \right)\right) \mathbf = \sum_i \left(\mathbf - \mathbf_i \mathbf_i^\mathsf \right) \mathbf_i$

where is the identity matrix. This is a matrix , with solution , where is the pseudo-inverse of .

Non-Euclidean geometry

In spherical geometry, any two lines intersect.

In hyperbolic geometry, given any line and any point, there are infinitely many lines through that point that do not intersect the given line.

See also

*Line segment intersection
* Line intersection in projective space
*Distance between two parallel lines
*Distance from a point to a line
* Line–plane intersection
*Parallel postulate
*Triangulation (computer vision)
*

References

External links

Distance between Lines and Segments with their Closest Point of Approach
applicable to two, three, or more dimensions.

{{DEFAULTSORT:Line-line intersection
Euclidean geometry
Linear algebra
Geometric algorithms
Geometric intersection