- Point on plane closest to origin
-
In Euclidean 3-space we will find the point on an arbitrary plane that is closest to the origin using the method of Lagrange multipliers.
First, let us start with an arbitrary plane, ax + by + cz = d. The distance, L, from the origin to a point (x,y,z) on the plane is given by:
Therefore the function that we want to minimize is:
Our one constraint on x, y, and z is that the point (x,y,z) must lie on the given plane. Thus, we define g(x,y,z) = ax + by + cz - d.
Next we define a new function with a Lagrange multiplier, λ
Take the partial of f * with respect to x, y, and z and set each to zero.
Now each partial includes a λ and a term.
If we solve each equation for and set them equal to one another
we can find the relation:
From this we can obtain y and z as functions of x:
and
Substitute these for y and z in the equation of the plane and solve for x to obtain:
With this x you can solve for y and z:
and
Hence the point on the plane closest to the origin is:
and the distance is given by:
An applied solution to this problem using linear algebra
This approach is useful in computational geometry and applications of computer graphics.
Given a plane defined by three points p0, p1, and p2.
The normal for this plane is
The nearest point p on the plane to the origin is the orthogonal projection of any point on the plane onto the plane's normal
- p = nd
Composed of the distance d from the plane to the origin, which is the dot product of n and any point on the plane such as p0.
Categories:- Copy to Wikiversity
- Euclidean geometry
- Geometric algorithms
Wikimedia Foundation. 2010.