### Coplanar

In geometry, a set of points in space is **coplanar** if all the points lie in the same geometric plane. For example, three distinct points are always coplanar; but a fourth point or more added in space can exist in another plane, or, **incoplanarly**.

Two lines in three-dimensional space are coplanar if there is a plane that includes them both. This occurs if the lines are parallel, or if they intersect each other.

Distance geometry provides a solution to the problem of determining if a set of points is coplanar, knowing only the distances between them.

## Properties

If three vectors $\backslash mathbf\{a\},\; \backslash mathbf\{b\}$ and $\backslash mathbf\{c\}$ are coplanar, and $\backslash mathbf\{a\}\backslash cdot\backslash mathbf\{b\}\; =\; 0$, then

- $(\backslash mathbf\{c\}\backslash cdot\backslash mathbf\{\backslash hat\; a\})\backslash mathbf\{\backslash hat\; a\}\; +\; (\backslash mathbf\{c\}\backslash cdot\backslash mathbf\{\backslash hat\; b\})\backslash mathbf\{\backslash hat\; b\}\; =\; \backslash mathbf\{c\},$

where $\backslash mathbf\{\backslash hat\; a\}$ denotes the unit vector in the direction of $\backslash mathbf\{a\}$.

Or, the vector resolutes of $\backslash mathbf\{c\}$ on $\backslash mathbf\{a\}$ and $\backslash mathbf\{c\}$ on $\backslash mathbf\{b\}$ add to give the original $\backslash mathbf\{c\}$.

## Plane formula

Another technique involves computing the formula for the planes defined by each subset of three points. First, the normal vector for each plane is computed using some orthogonalization technique. If the planes are parallel, then the dot-product of their normal vectors will be 1 or −1. More specifically, the angle between the normal vectors can be computed. This is called the dihedral angle, and represents the smallest possible angle between the two planes. The formula for a plane is:

- $ax+by+cz+d=0$, where $(a,b,c)$ is the normal vector of the plane.

The value $d$ can be computed by substituting one of the points and then solving. If $d$ is the same for all subsets of three points, then the planes are the same.

One advantage of this technique is that it can work in hyper-dimensional space. For example, suppose one wants to compute the dihedral angle between two *m*-dimensional hyperplanes defined by *m* points in *n*-dimensional space. If $n-m>1$, then there are an infinite number of normal vectors for each hyperplane, so the angle between two of them is not necessarily the dihedral angle. However, if the Gram–Schmidt process is used, using the same initial vector in both cases, then the angle between the two normal vectors will be minimal, and therefore will be the dihedral angle between the hyperplanes.

## References

## External links

- MathWorld.