Coplanarity

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.

Points can be shown to be coplanar by determining that the scalar product of a vector that is normal to the plane and a vector from any point on the plane to the point being tested is 0. To put this another way, if you have a set of points which you want to determine are coplanar, first construct a vector for each point to one of the other points (by using the distance formula, for example). Secondly, construct a vector which is perpendicular (normal) to the plane to test (for example, by computing the cross product of two of the vectors from the first step). Finally, compute the dot product (which is the same as the scalar product) of this vector with each of the vectors you created in the first step. If the result of each dot product is 0, then all the points are coplanar.

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 $\mathbf{a}, \mathbf{b}$ and $\mathbf{c}$ are coplanar, and $\mathbf{a}\cdot\mathbf{b} = 0$ , then

$(\mathbf{c}\cdot\mathbf{\hat a})\mathbf{\hat a} %2B (\mathbf{c}\cdot\mathbf{\hat b})\mathbf{\hat b} = \mathbf{c},$

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

Or, the vector resolutes of $\mathbf{c}$ on $\mathbf{a}$ and $\mathbf{c}$ on $\mathbf{b}$ add to give the original $\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%2Bby%2Bcz%2Bd=0$ , where $(a,b,c)$ is the normal vector of the plane.

The value $d$ can be computed by plugging in 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 you wanted 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 you use Gram-Schmidt process 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.

External links

Weisstein, Eric W., "Coplanar" from MathWorld.