Intersection of Two Lines Calculator

The Intersection of Two Lines Calculator finds the point where two lines meet using Cramer's Rule. Given two linear equations in the form $$a_1 x + b_1 y = c_1$$ and $$a_2 x + b_2 y = c_2$$, this calculator solves the system to determine the intersection point, the angle between the lines, and whether the system is consistent.

The solution uses Cramer's Rule, which expresses the solution in terms of determinants. The system determinant is:

$$D = a_1 b_2 - a_2 b_1$$

If $$D \neq 0$$, the lines intersect at a unique point:

$$x = \frac{c_1 b_2 - c_2 b_1}{D}, \quad y = \frac{a_1 c_2 - a_2 c_1}{D}$$

These formulas are derived from the coefficient matrix of the linear system:

$$\begin{pmatrix} a_1 & b_1 \\ a_2 & b_2 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} c_1 \\ c_2 \end{pmatrix}$$

When $$D = 0$$, the lines are either parallel (no intersection) or coincident (infinitely many intersections). Parallel lines have the same slope but different intercepts, while coincident lines are the same line expressed differently.

The angle between two intersecting lines with slopes $$m_1$$ and $$m_2$$ is:

$$\theta = \arctan\left|\frac{m_1 - m_2}{1 + m_1 m_2}\right|$$

This formula gives the acute angle between the lines. If $$1 + m_1 m_2 = 0$$, the lines are perpendicular ($$\theta = 90°$$).

Finding the intersection of two lines is a fundamental operation in computational geometry. In computer graphics, ray-line intersection tests determine visibility and collision detection. In economics, supply and demand curves intersect at the market equilibrium point. In navigation, the intersection of two bearing lines determines a ship's position (triangulation). In civil engineering, road intersections are designed by computing where centerlines meet. In linear programming, the feasible region's vertices are found by intersecting constraint lines, and the optimal solution often lies at one of these vertices.

Cramer's Rule extends naturally to higher dimensions. For three equations in three unknowns, the determinant of the 3×3 coefficient matrix determines whether a unique solution exists. The method is conceptually elegant but computationally expensive for large systems, where Gaussian elimination or matrix factorization methods are preferred. Nevertheless, for 2×2 systems, Cramer's Rule is efficient and yields closed-form expressions.

The determinant $$D$$ also has a geometric interpretation: its absolute value equals the area of the parallelogram formed by the coefficient vectors $$(a_1, b_1)$$ and $$(a_2, b_2)$$. When this area is zero, the vectors are parallel, and so are the lines.