Euclidean distance

In mathematics, the Euclidean distance or Euclidean metric is the "ordinary" (i.e. straight-line) distance between two points in Euclidean space. With this distance, Euclidean space becomes a metric space. The associated norm is called the Euclidean norm. Older literature refers to the metric as Pythagorean metric. A generalized term for the Euclidean norm is the L² norm or L² distance.

Definition

The Euclidean distance between points p and q is the length of the line segment connecting them ($\overline{\mathbf{p}\mathbf{q}}$).

In Cartesian coordinates, if p = (p₁, p₂,..., p_n) and q = (q₁, q₂,..., q_n) are two points in Euclidean n-space, then the distance (d) from p to q, or from q to p is given by the Pythagorean formula:

$\begin{align}\mathrm{d}(\mathbf{p},\mathbf{q}) = \mathrm{d}(\mathbf{q},\mathbf{p}) & = \sqrt{(q_1-p_1)^2 + (q_2-p_2)^2 + \cdots + (q_n-p_n)^2} \\[8pt] & = \sqrt{\sum_{i=1}^n (q_i-p_i)^2}.\end{align}$

(1)

The position of a point in a Euclidean n-space is a Euclidean vector. So, p and q are Euclidean vectors, starting from the origin of the space, and their tips indicate two points. The Euclidean norm, or Euclidean length, or magnitude of a vector measures the length of the vector:

$\left\|{\mathbf {p}}\right\|={\sqrt {p_{1}^{2}+p_{2}^{2}+\cdots +p_{n}^{2}}}={\sqrt {{\mathbf {p}}\cdot {\mathbf {p}}}},$

where the last equation involves the dot product.

A vector can be described as a directed line segment from the origin of the Euclidean space (vector tail), to a point in that space (vector tip). If we consider that its length is actually the distance from its tail to its tip, it becomes clear that the Euclidean norm of a vector is just a special case of Euclidean distance: the Euclidean distance between its tail and its tip.

The distance between points p and q may have a direction (e.g. from p to q), so it may be represented by another vector, given by

${\displaystyle \mathbf {q} -\mathbf {p} =(q_{1}-p_{1},q_{2}-p_{2},\cdots ,q_{n}-p_{n}).}$

In a three-dimensional space (n=3), this is an arrow from p to q, which can be also regarded as the position of q relative to p. It may be also called a displacement vector if p and q represent two positions of the same point at two successive instants of time.

The Euclidean distance between p and q is just the Euclidean length of this distance (or displacement) vector:

$\left\|{\mathbf {q}}-{\mathbf {p}}\right\|={\sqrt {({\mathbf {q}}-{\mathbf {p}})\cdot ({\mathbf {q}}-{\mathbf {p}})}}.$

(2)

which is equivalent to equation 1, and also to:

$\left\|{\mathbf {q}}-{\mathbf {p}}\right\|={\sqrt {\left\|{\mathbf {p}}\right\|^{2}+\left\|{\mathbf {q}}\right\|^{2}-2{\mathbf {p}}\cdot {\mathbf {q}}}}.$

One dimension

In one dimension, the distance between two points on the real line is the absolute value of their numerical difference. Thus if x and y are two points on the real line, then the distance between them is given by:

$\sqrt{(x-y)^2} = |x-y|.$

In one dimension, there is a single homogeneous, translation-invariant metric (in other words, a distance that is induced by a norm), up to a scale factor of length, which is the Euclidean distance. In higher dimensions there are other possible norms.

Two dimensions

In the Euclidean plane, if p = (p₁, p₂) and q = (q₁, q₂) then the distance is given by

${\mathrm {d}}({\mathbf {p}},{\mathbf {q}})={\sqrt {(q_{1}-p_{1})^{2}+(q_{2}-p_{2})^{2}}}.$

This is equivalent to the Pythagorean theorem.

Alternatively, it follows from (2) that if the polar coordinates of the point p are (r₁, θ₁) and those of q are (r₂, θ₂), then the distance between the points is

$\sqrt{r_1^2 + r_2^2 - 2 r_1 r_2 \cos(\theta_1 - \theta_2)}.$

Three dimensions

In three-dimensional Euclidean space, the distance is

$d(p, q) = \sqrt{(p_1 - q_1)^2 + (p_2 - q_2)^2+(p_3 - q_3)^2}.$

n dimensions

In general, for an n-dimensional space, the distance is

$d(p, q) = \sqrt{(p_1- q_1)^2 + (p_2 - q_2)^2+\cdots+(p_i - q_i)^2+\cdots+(p_n - q_n)^2}.$

Squared Euclidean distance

The standard Euclidean distance can be squared in order to place progressively greater weight on objects that are farther apart. In this case, the equation becomes

$d^2(p, q) = (p_1 - q_1)^2 + (p_2 - q_2)^2+\cdots+(p_i - q_i)^2+\cdots+(p_n - q_n)^2.$

Squared Euclidean Distance is not a metric as it does not satisfy the triangle inequality, however, it is frequently used in optimization problems in which distances only have to be compared.

It is also referred to as quadrance within the field of rational trigonometry.

See also

• Chebyshev distance measures distance assuming only the most significant dimension is relevant.
• Euclidean distance matrix
• Hamming distance identifies the difference bit by bit of two strings
• Mahalanobis distance normalizes based on a covariance matrix to make the distance metric scale-invariant.
• Manhattan distance measures distance following only axis-aligned directions.
• Akritean distance
• Metric
• Minkowski distance is a generalization that unifies Euclidean distance, Manhattan distance, and Chebyshev distance.
• Pythagorean addition
• Haversine distance giving great-circle distances between two points on a sphere from their longitudes and latitudes.
• Vincenty's formulae well known as "Vincent distance"

References

• Deza, Elena; Deza, Michel Marie (2009). Encyclopedia of Distances. Springer. p. 94.
• "Cluster analysis". March 2, 2011.