World Library  
Flag as Inappropriate
Email this Article


Article Id: WHEBN0003842410
Reproduction Date:

Title: Coplanar  
Author: World Heritage Encyclopedia
Language: English
Subject: Aromaticity
Publisher: World Heritage Encyclopedia


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.


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} + (\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+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.


External links

  • MathWorld.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from World Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.