Goal
Find one finite point and a direction vector for the intersection line of two nonparallel planes.
Worldwide context
Saved once here, used across the site.
Currency changes display only. Country selection guides tax input; no tax rate is guessed.
Find one finite point and a direction vector for the intersection line of two nonparallel planes.
For n1=(a1,b1,c1), n2=(a2,b2,c2), direction=n1 x n2. Return the closest-to-origin point on both planes using the Gram system and line point+t*direction.A clearer path to an answer
This page keeps the calculation transparent: define the goal, enter the matching values, inspect the method, and decide what the result means in your situation.
Find one finite point and a direction vector for the intersection line of two nonparallel planes.
Plane 1 coefficient a · Plane 1 coefficient b · Plane 1 coefficient c · Plane 1 constant d · Plane 2 coefficient a · Plane 2 coefficient b · Plane 2 coefficient c · Plane 2 constant d
For n1=(a1,b1,c1), n2=(a2,b2,c2), direction=n1 x n2. Return the closest-to-origin point on both planes using the Gram system and line point+t*direction.
Calculate, review the assumptions below, then compare a related tool when the decision needs more context.
Find one finite point and a direction vector for the intersection line of two nonparallel planes.
Open the Line of Intersection of Two Planes pageMore math tools
Download PDFDownload Word (.doc)
Enter your values above and choose Calculate to see the result here.
Calculation map
For n1=(a1,b1,c1), n2=(a2,b2,c2), direction=n1 x n2. Return the closest-to-origin point on both planes using the Gram system and line point+t*direction.
Bounded, transparent calculation
Your recent runs stay in this browser session only.
Formula: For n1=(a1,b1,c1), n2=(a2,b2,c2), direction=n1 x n2. Return the closest-to-origin point on both planes using the Gram system and line point+t*direction.
Nonparallel plane normals have a nonzero cross product, which gives a direction parallel to both planes. The point convention is the unique intersection point closest to the origin; parallel or coincident planes are rejected.
Worked example: The planes x=1 and y=2 intersect in the line (1,2,0)+t*(0,0,1); the returned point is the closest point to the origin.
The displayed limits are checked before the handler runs. Model-specific domain checks may also reject impossible or non-finite inputs.
Methodology: This calculator follows the WorldCalculate input, formula, precision, and boundary policy. Read the official methodology.
Calculator usage statistics
This section counts anonymous successful Calculate submissions, not unique visitors. Counts and top tools appear only when trusted aggregate data is available; country analysis is shown only under the same condition and reporting threshold.
Answer-first guide
Find one finite point and a direction vector for the intersection line of two nonparallel planes. Start with one clearly defined goal, enter values in the units shown, and keep the result attached to the assumptions below.
This tool is useful when your question includes plane intersection, line of intersection, 3D planes. It returns the outputs declared in the calculator contract rather than a live quote, approval, diagnosis, or professional sign-off.
Plane 1 coefficient a · Plane 1 coefficient b · Plane 1 coefficient c · Plane 1 constant d · Plane 2 coefficient a · Plane 2 coefficient b · Plane 2 coefficient c · Plane 2 constant d. Keep the same time period, unit system, and currency wherever the form requires comparable values.
Run the worked example first, compare its output with the page's example, then change one input at a time. This makes an unexpected result easier to trace to a unit, boundary, or assumption.
Need a wider view? Browse Math Calculators or compare the related tools below. The WorldCalculate methodology explains how formulas, examples, limits, and revisions are reviewed.
For n1=(a1,b1,c1), n2=(a2,b2,c2), direction=n1 x n2. Return the closest-to-origin point on both planes using the Gram system and line point+t*direction.
Nonparallel plane normals have a nonzero cross product, which gives a direction parallel to both planes. The point convention is the unique intersection point closest to the origin; parallel or coincident planes are rejected.
The planes x=1 and y=2 intersect in the line (1,2,0)+t*(0,0,1); the returned point is the closest point to the origin.
Context and background
Math calculators move from named quantities to a relation, then to a result that can be checked with substitution, units, or an alternate form.
Arithmetic, algebra, geometry, trigonometry, and number theory provide reusable structures for classroom work and everyday reasoning. Each page narrows that structure to one declared problem.
Research and review
Researched by Hassan ALRowaie, Founder and editorial researcher at WorldCalculate.
This guide follows the live calculator's declared inputs, formula, worked example, assumptions, validation boundaries, and source-backed methodology. The review date describes editorial review of the calculator explanation; it is not a promise that external facts or rates remain current.
Two nonparallel planes in three-dimensional Euclidean space meet along a line. This calculator accepts the eight coefficients of two equations, computes a direction from the cross product of their normals, and chooses one reproducible point on the line: the point closest to the origin. The output gives the three point coordinates and the three raw direction components. It rejects zero normals and parallel or coincident planes before any unstable division. The guide explains the plane convention, cross-product direction, closest-point choice, worked example, finite limits, related constructions, source boundary, assumptions, FAQs, and the distinction between a mathematical intersection and a physical design conclusion.
The result is a parametric line written conceptually as p+t*v. The point p is one particular solution of both plane equations, and v is a vector parallel to both planes. Every real parameter t traces another point on the intersection line. Because infinitely many points belong to one line, a convention is needed. This page chooses the point with minimum Euclidean distance to the origin, which makes repeated calculations deterministic without asking the visitor to supply an extra parameter.
The output does not return a single isolated intersection point because two nonparallel planes generally share infinitely many points. It also does not return a normalized direction by default. The raw cross product preserves the scale and orientation induced by the order of the plane normals. Reversing the plane order reverses the direction but describes the same geometric line; the point convention remains the same.
Plane 1 is a1*x+b1*y+c1*z+d1=0, and plane 2 is a2*x+b2*y+c2*z+d2=0. The first three coefficients of each plane form its normal vector. The final coefficient is the constant. The row of fields is deliberately grouped by plane so a coefficient cannot be confused with a coordinate of the output point. Write both equations in the same equals-zero arrangement before entry; moving a constant to the other side without changing its sign would change d.
All eight entries are finite numbers within the displayed bounds. Negative, zero, and fractional coefficients are valid. A plane with a1=b1=c1=0 has no normal and does not define an ordinary plane, so it is rejected. The handler repeats the checks made by the form and does not coerce strings, blanks, NaN, infinity, or out-of-range values. Coefficient units and coordinate units need a coherent surrounding interpretation.
A vector parallel to both planes must be perpendicular to both normals. The cross product supplies that vector: n1 x n2=(b1*c2-c1*b2, c1*a2-a1*c2, a1*b2-b1*a2). Each component is a finite arithmetic combination of the plane coefficients. When the normals are not parallel, this vector is nonzero and points along the intersection line. Its sign depends on the order n1 then n2, but its span is unchanged if the order is reversed.
The direction is not normalized because a raw cross product is transparent and avoids hiding the coefficient scale. A caller that needs a unit direction can divide by its finite length as a separate step. The calculator checks the direction length against a conservative scale-relative threshold, rejecting nearly parallel normals before solving for the point. This protects the point calculation from a denominator that would amplify small coefficient differences.
Every point on the intersection line has the form p+t*v. The point closest to the origin must be perpendicular to the line direction, so it lies in the span of the two normals. Write p=alpha*n1+beta*n2 and solve the two plane equations for alpha and beta. The resulting two-by-two Gram system uses n1 dot n1, n1 dot n2, and n2 dot n2. Its determinant is the squared length of n1 cross n2, which is positive for nonparallel normals.
This convention avoids selecting an arbitrary coordinate such as z=0, which may not intersect the line. It also works when the line is parallel to a coordinate plane or has no simple zero coordinate. The handler computes alpha and beta with finite checked products, constructs p, and returns the same point for equivalent equations that differ only by a common nonzero scale, subject to floating-point precision.
Use plane 1 x-1=0 and plane 2 y-2=0. Their normals are n1=(1,0,0) and n2=(0,1,0), so the cross product is (0,0,1). The closest point on the common line is p=(1,2,0). The parametric result is (1,2,0)+t*(0,0,1). Substitution gives 1-1=0 for plane 1 and 2-2=0 for plane 2, confirming that the point belongs to both.
The direction length is one in this simple example, but that is not generally true. If the second plane were written 2y-4=0, its normal would be twice as long, and the raw cross product would change scale while the line would not. The closest point remains (1,2,0) because scaling an equation does not change its solution set. This is a useful check of the point convention and the distinction between line direction and unit direction.
If n1 cross n2 is zero, the normals are parallel. The planes may be distinct and never meet, or they may represent the same geometric plane after scaling. In either case there is no unique intersection line. The handler rejects both parallel and coincident situations with one explicit model error rather than guessing which interpretation applies from coefficient ratios. A zero normal is rejected separately because it does not define a plane at all.
Nearly parallel normals can produce a very short cross product. The mathematical line may exist, but the closest-point division can be highly sensitive to small input changes. The scale-relative guard is a conservative numerical boundary, not a universal geometric law. It is especially relevant when coefficients are rounded measurements. If a near-parallel result matters, use a precision and conditioning analysis suited to the source data rather than weakening this renderer-safe contract.
The handler validates every plane coefficient, both normal lengths, the cross-product components, Gram products, denominator, point coefficients, and point coordinates. It rejects a nonfinite intermediate before it can reach the result list. Numeric entries are normalized away from negative zero and labeled by whether they belong to the point or the direction. The steps preserve the parametric meaning so a renderer does not need to reconstruct a tuple from prose.
A reviewer can check three properties. Substitute the returned point into both plane equations. Take the dot product of the returned direction with each normal and confirm both are zero within a declared tolerance. Finally, check that the point is perpendicular to the direction, which expresses the closest-to-origin convention. These checks distinguish a valid arbitrary point on the line from the specific point convention used here.
A line through two points uses a different input contract and can return an implicit two-dimensional equation. A plane through a point and a normal uses one plane rather than a pair. The present page requires two three-dimensional plane equations and returns a parametric line. It is not the same as the intersection of two lines, the distance between planes, or the closest points between skew lines. Similar words such as intersection and direction do not make those models interchangeable.
The point convention also matters when comparing implementations. Some systems choose a coordinate by setting one parameter to zero, while this page chooses the closest point to the origin. Such outputs can differ by a multiple of the same direction and still describe the same line. Preserve the convention with any exported result so a reviewer does not mistake a different but equivalent point for an arithmetic defect.
The plane-intersection reference in the catalog is private formula metadata used for research review. This article and its examples are original WorldCalculate writing. The reference does not provide another page's body, code, branding, defaults, or calculator data, and it cannot validate the units or provenance of entered coefficients. Formula provenance verifies the geometric construction; it does not turn a finite result into an engineering approval.
The model assumes ordinary finite Euclidean coordinates, equations already arranged with zero on the right, nonzero normals, and a genuinely nonparallel pair. It excludes curved surfaces, noisy least-squares fitting, tolerance envelopes, moving frames, and physical material constraints. A line of mathematical intersection may not be an accessible path or a safe structural feature. Keep frame, units, uncertainty, and domain review outside the calculator.
Why return a point closest to the origin? A line contains infinitely many valid points, so the convention makes the result reproducible. Why is the direction not a unit vector? The raw cross product is the direct normal-cross-normal construction; normalizing it would be a separate presentation or geometry choice. What if the planes are coincident? They share a plane rather than one unique line, so this page rejects them together with other parallel cases.
Can the returned point be outside a physical object? Yes. The calculator knows only two infinite mathematical planes and the origin convention. It does not clip the line to a segment, object, room, or material boundary. Can I multiply a plane equation by a constant? Yes, a nonzero common scaling preserves that plane, though floating-point conditioning can change. The conservative limit is a finite ideal-plane intersection, not a fit, route, or design validation.
The returned point should satisfy a1*x+b1*y+c1*z+d1=0 and the corresponding equation for plane 2. The returned direction should satisfy a1*vx+b1*vy+c1*vz=0 and the same dot product with the second normal. These substitutions check incidence and parallelism independently. A point can lie on one plane but not the other, or a vector can be parallel to one plane but not both, if a coefficient is transposed. Testing all four relationships is a strong review of the result.
The closest-point convention adds one more check: p dot v should be zero. If p is shifted by any multiple of v, it remains on the intersection line but is generally farther from the origin. The handler's Gram-system construction selects the perpendicular member of that family. These checks use unrounded numeric outputs and should apply tolerances suited to coefficient scale rather than comparing decimal strings exactly.
Multiplying every coefficient of one plane by a nonzero scalar leaves its geometric plane unchanged. The normal length and cross-product direction scale, and the Gram coefficients change accordingly, but the selected closest point should remain the same within numerical precision. This invariance is useful when an equation has been normalized or its constants were cleared from fractions. It also explains why raw direction magnitude is not a coordinate-free unit-length quantity.
Scaling by a very large or very small number can still affect floating-point conditioning even though the exact plane is unchanged. The displayed coefficient bounds and finite checks provide a practical browser contract, not arbitrary-scale exact arithmetic. If inputs differ greatly in magnitude or come from rounded measurements, rescale them consistently and assess the resulting sensitivity before using the line in a high-consequence workflow.
Once p and v are returned, every point on the ideal intersection line can be written as p+t*v. The parameter t is dimensionless if p and v use the same coordinate scale, but its numerical size depends on the raw direction magnitude. A unit-direction representation would use a different parameter with length meaning. The current page deliberately returns raw v so the construction remains the direct cross product and the note tells the caller not to treat it as normalized.
The line is infinite in both directions. The calculator does not clip it to a box, segment, plane patch, room, or object. If an application needs a bounded portion, evaluate p+t*v against its explicit constraints and preserve the parameter interval. Choosing t=0 gives the closest point only because of the page's point convention; it does not mean the physical object begins there or that other line points are invalid.
When two plane normals are nearly parallel, their cross product is short relative to the product of their normal lengths. The planes may technically meet in a line, but small coefficient changes can move the closest point substantially. The handler uses a scale-relative guard before dividing by the squared direction length. This is a conservative numerical rule designed for stable browser output, not a claim that every near-parallel pair is mathematically invalid.
A measured plane should carry the precision and uncertainty of its coefficients. If the uncertainty is comparable to the normal angle, the intersection line may be poorly determined even when one calculation returns finite values. A robust geometric workflow may use interval, least-squares, or covariance methods, none of which are represented by these eight scalar fields. Keep that distinction visible when comparing this result with survey, CAD, or physical data.
A focused suite should use x=1 and y=2 as the default perpendicular example, then use two oblique planes to verify all three direction components. It should assert the returned point in both equations, the direction dot products, and p dot v. It should reject a zero normal, parallel normals, and coincident equations with useful Errors. It should also test equation scaling and bounded coefficients so the point convention is not validated only for the easiest axis-aligned case.
The catalog record should preserve the exact eight-field order and the example keys. The generic registry test must invoke `line-of-intersection-of-two-planes` once and check that all six numeric results are finite and serializable. Separating focused geometric invariants from the generic renderer sweep catches both a wrong Gram-system sign and a missing registry binding. The browser route can then be trusted to expose the same pure result rather than a duplicate calculation.
A complete report should state both plane equations, the selected closest-to-origin point convention, and whether the direction is raw or normalized. The same geometric line can be represented by a different point or by a direction multiplied by any nonzero scalar. Without those conventions, two correct results may appear inconsistent. The handler's labels and note make the choice explicit, but a data export should preserve it as well.
The result is best treated as an ideal analytic construction. If the planes came from measured surfaces, retain coefficient precision, coordinate units, and the uncertainty or fitting method used to create them. If the line is later clipped to a model or used as a route, add the boundary constraints explicitly. A finite point and direction do not establish accessibility, physical intersection, or a safe operating path.
Two implementations may return different point-plus-direction triples and still describe the same line. A point shifted by t times the direction remains on the intersection, and a direction multiplied by a nonzero constant spans the same set. The convention used here removes that ambiguity by choosing the closest point to the origin and retaining the raw cross product. A review should compare the geometric line and the declared convention rather than requiring arbitrary point equality from another implementation.
The original plane coefficients should remain available for substitution and for tracing how a line was generated. If a later system normalizes the direction, it should mark that transformation and update the parameter meaning. If it clips the line or fits noisy planes, those are new operations with new assumptions. The pure L1 result is a stable analytic reference, not a replacement for that richer audit trail.
Find one finite point and a direction vector for the intersection line of two nonparallel planes.
For n1=(a1,b1,c1), n2=(a2,b2,c2), direction=n1 x n2. Return the closest-to-origin point on both planes using the Gram system and line point+t*direction. Nonparallel plane normals have a nonzero cross product, which gives a direction parallel to both planes. The point convention is the unique intersection point closest to the origin; parallel or coincident planes are rejected.
Enter Plane 1 coefficient a, Plane 1 coefficient b, Plane 1 coefficient c, Plane 1 constant d, Plane 2 coefficient a, Plane 2 coefficient b, Plane 2 coefficient c, Plane 2 constant d, then choose Calculate.
Each plane is a finite real equation a*x+b*y+c*z+d=0 with a nonzero normal vector. The planes are nonparallel, so their intersection is one line; the direction returned is the raw n1 cross n2 vector and is not normalized. The selected point is the closest point to the origin on that line, not an arbitrary point and not a least-squares fit.
This calculator is part of the WorldCalculate library. Its formula, example, assumptions, input bounds, and output formatting follow the official methodology.
These WorldCalculate collections connect this tool with related questions while keeping each calculation separate and transparent.