Intersection (geometry)

In geometry, an intersection between geometric objects (seen as sets of points) is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces).

Uses your system voice; voice and rate in settings.

≈ 11 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In geometry, an intersection between geometric objects (seen as sets of points) is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces). The simplest case in Euclidean geometry is the line–line intersection between two distinct lines, which either is one point (sometimes called a vertex) or empty (if the lines are parallel).

Other types of geometric intersection include: Line–plane intersection Line–sphere intersection Intersection of a polyhedron with a line Line segment intersection Intersection curve Determination of the intersection of flats – linear geometric objects embedded in a higher-dimensional space – is a simple task of linear algebra, namely the solution of a system of linear equations. In general the determination of an intersection leads to non-linear equations, which can be solved numerically, for example using Newton iteration.

Intersection problems between a line and a conic section (circle, ellipse, parabola, etc.) or a quadric (sphere, cylinder, hyperboloid, etc.) lead to quadratic equations that can be easily solved. Intersections between quadrics lead to quartic equations that can be solved algebraically.

The notion of intersection from geometry has been exended to the status of an operation with sets, intersection (set theory), in works by Giuseppe Peano. a_1x+b_1y=c_1, \ a_2x+b_2y=c_2 one gets, from Cramer's rule or by substituting out a variable, the coordinates of the intersection point (x_s,y_s) : x_s=\frac{c_1b_2-c_2b_1}{a_1b_2-a_2b_1} , \quad y_s=\frac{a_1c_2-a_2c_1}{a_1b_2-a_2b_1}. \ (If a_1b_2-a_2b_1=0 the lines are parallel and these formulas cannot be used because they involve dividing by 0.) (x(s),y(s))=(x_1+s(x_2-x_1),y_1+s(y_2-y_1)), (x(t),y(t))=(x_3+t(x_4-x_3),y_3+t(y_4-y_3)).

The line segments intersect only in a common point (x_0,y_0) of the corresponding lines if the corresponding parameters s_0,t_0 fulfill the condition 0\le s_0,t_0 \le 1 . The parameters s_0,t_0 are the solution of the linear system s(x_2-x_1)-t(x_4-x_3)=x_3-x_1, s(y_2-y_1)-t(y_4-y_3)=y_3-y_1 \ . It can be solved for s and t using Cramer's rule (see above).

If the condition 0\le s_0,t_0 \le 1 is fulfilled one inserts s_0 or t_0 into the corresponding parametric representation and gets the intersection point (x_0,y_0) . Example: For the line segments (1,1),(3,2) and (1,4),(2,-1) one gets the linear system 2s-t=0 s+5t=3 and s_0=\tfrac{3}{11}, t_0=\tfrac{6}{11} . That means: the lines intersect at point (\tfrac{17}{11},\tfrac{14}{11}) .

Remark: Considering lines, instead of segments, determined by pairs of points, each condition 0\le s_0,t_0 \le 1 can be dropped and the method yields the intersection point of the lines (see above). line ax+by=c and circle x^2+y^2=r^2 one solves the line equation for or and substitutes it into the equation of the circle and gets for the solution (using the formula of a quadratic equation) (x_1,y_1),(x_2,y_2) with x_{1/2}= \frac{ac\pm b\sqrt{r^2(a^2+b^2)-c^2}}{a^2+b^2} \ , y_{1/2}= \frac{bc\mp a\sqrt{r^2(a^2+b^2)-c^2}}{a^2+b^2} \ , if r^2(a^2+b^2)-c^2 > 0 \ . If this condition holds with strict inequality, there are two intersection points; in this case the line is called a secant line of the circle, and the line segment connecting the intersection points is called a chord of the circle.

If r^2(a^2+b^2)-c^2=0 holds, there exists only one intersection point and the line is tangent to the circle. If the weak inequality does not hold, the line does not intersect the circle.

Another quick way to derive the intersection points is the ansatz (x_{1/2}, y_{1/2}) = s (a, b) \pm t (b, -a) , solving first for s using the line equation, which simplifies to s (a^2+b^2) = c and then for t using the circle equation, which simplifies to (s^2 + t^2)(a^2+b^2) = r^2 . If the circle's midpoint is not the origin, see.

The intersection of a line and a parabola or hyperbola may be treated analogously. (x-x_1)^2+(y-y_1)^2=r_1^2 ,\ \quad (x-x_2)^2+(y-y_2)^2=r_2^2 can be reduced to the previous case of intersecting a line and a circle. By subtraction of the two given equations one gets the line equation: 2(x_2-x_1)x+2(y_2-y_1)y=r_1^2-x_1^2-y_1^2-r_2^2+x_2^2+y_2^2.

This special line is the radical line of the two circles. Special case \;x_1=y_1=y_2=0 : In this case the origin is the center of the first circle and the second center lies on the x-axis (s. diagram).

The equation of the radical line simplifies to \;2x_2x=r_1^2-r_2^2+x_2^2\; and the points of intersection can be written as (x_0,\pm y_0) with x_0=\frac{r_1^2-r_2^2+x_2^2}{2x_2},\quad y_0 =\sqrt{r_1^2-x_0^2}\ . In case of r_1^2 the circles have no points in common. In case of r_1^2=x_0^2 the circles have one point in common and the radical line is a common tangent.

Any general case as written above can be transformed by a shift and a rotation into the special case. The intersection of two disks (the interiors of the two circles) forms a shape called a lens. If both curves are explicitly given: y=f_1(x), \ y=f_2(x) , equating them yields the equation f_1(x)=f_2(x) \ .

If both curves are parametrically given: C_1: (x_1(t),y_1(t)), \ C_2: (x_2(s),y_2(s)). Equating them yields two equations in two variables: x_1(t)=x_2(s), \ y_1(t)=y_2(s) \ . If one curve is parametrically and the other implicitly given: C_1: (x_1(t),y_1(t)), \ C_2: f(x,y)=0. This is the simplest case besides the explicit case.

One has to insert the parametric representation of C_1 into the equation f(x,y)=0 of curve C_2 and one gets the equation: f(x_1(t),y_2(t))=0 \ . If both curves are implicitly given: C_1: f_1(x,y)=0, \ C_2: f_2(x,y)=0. Here, an intersection point is a solution of the system f_1(x,y)=0, \ f_2(x,y)=0 \ .

Any Newton iteration needs convenient starting values, which can be derived by a visualization of both the curves. A parametrically or explicitly given curve can easily be visualized, because to any parameter or respectively it is easy to calculate the corresponding point. For implicitly given curves this task is not as easy.

In this case one has to determine a curve point with help of starting values and an iteration. See . Examples: 1: C_1: (t,t^3) and circle C_2: (x-1)^2+(y-1)^2-10=0 (see diagram).

The Newton iteration t_{n+1}:=t_n-\frac{f(t_n)}{f'(t_n)} for function f(t)=(t-1)^2+(t^3-1)^2-10 has to be done. As start values one can choose −1 and 1.5. The intersection points are: (−1.1073, −1.3578), (1.6011, 4.1046) 2: C_1: f_1(x,y)=x^4+y^4-1=0, C_2: f_2(x,y)=(x-0.5)^2+(y-0.5)^2-1=0 (see diagram).

The Newton iteration {x_{n+1}\choose y_{n+1}}={x_{n}+\delta_x\choose y_n+\delta_y} has to be performed, where {\delta_x \choose \delta_y} is the solution of the linear system \begin{pmatrix} \frac{\partial f_1}{\partial x} & \frac{\partial f_1}{\partial y} \\ \frac{\partial f_2}{\partial x} & \frac{\partial f_2}{\partial y} \end{pmatrix}{\delta_x \choose \delta_y}={-f_1\choose -f_2} at point (x_n,y_n) . As starting values one can choose(−0.5, 1) and (1, −0.5).

The linear system can be solved by Cramer's rule. The intersection points are (−0.3686, 0.9953) and (0.9953, −0.3686).

Commonly a line in space is represented parametrically (x(t),y(t),z(t)) and a plane by an equation ax+by+cz=d . Inserting the parameter representation into the equation yields the linear equation ax(t)+by(t)+cz(t)=d\ , for parameter t_0 of the intersection point (x(t_0),y(t_0),z(t_0)) . If the linear equation has no solution, the line either lies on the plane or is parallel to it.

If a line is defined by two intersecting planes \varepsilon_i: \ \vec n_i\cdot\vec x=d_i, \ i=1,2 and should be intersected by a third plane \varepsilon_3: \ \vec n_3\cdot\vec x=d_3 , the common intersection point of the three planes has to be evaluated. Three planes \varepsilon_i: \ \vec n_i\cdot\vec x=d_i, \ i=1,2,3 with linear independent normal vectors \vec n_1,\vec n_2, \vec n_3 have the intersection point \vec p_0=\frac{d_1(\vec n_2\times \vec n_3) +d_2(\vec n_3\times \vec n_1) + d_3(\vec n_1\times \vec n_2)}{\vec n_1\cdot(\vec n_2\times \vec n_3)} \ .

For the proof one should establish \vec n_i\cdot\vec p_0=d_i, \ i=1,2,3 , using the rules of a scalar triple product. If the scalar triple product equals to 0, then planes either do not have the triple intersection or it is a line (or a plane, if all three planes are the same). implicit surface S: f(x,y,z)=0\ .

Example: parametric curve C: (t,t^2,t^3) and implicit surface S: x^4+y^4+z^4-1=0 (s. picture). The intersection points are: (−0.8587, 0.7374, −0.6332), (0.8587, 0.7374, 0.6332). A line–sphere intersection is a simple special case.

Like the case of a line and a plane, the intersection of a curve and a surface in general position consists of discrete points, but a curve may be partly or totally contained in a surface. x^2 + y^2 + z^2 = R^2. Also without loss of generality, assume that the second sphere, with radius r , is centered at a point on the positive x-axis, at distance a from the origin.

Its points satisfy (x-a)^2 + y^2 + z^2 = r^2. The intersection of the spheres is the set of points satisfying both equations. Subtracting the equations gives \begin{align} (x-a)^2 - x^2 & = r^2 - R^2 \\ a^2 - 2ax & = r^2 - R^2 \\ x & = \frac{a^2 + R^2 - r^2}{2a}. \end{align} In the singular case a = 0 , the spheres are concentric.

There are two possibilities: if R = r , the spheres coincide, and the intersection is the entire sphere; if R \not= r , the spheres are disjoint and the intersection is empty. When a is nonzero, the intersection lies in a vertical plane with this x-coordinate, which may intersect both of the spheres, be tangent to both spheres, or external to both spheres.

The result follows from the previous proof for sphere-plane intersections.

See also

Line-plane intersection Line–sphere intersection Line-cylinder intersection Plane–plane intersection Analytic geometry#Intersections Computational geometry Equation of a line

Further reading

Nicholas M. Patrikalakis and Takashi Maekawa, Shape Interrogation for Computer Aided Design and Manufacturing, Springer, 2002, , 9783540424543, pp. 408.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1373695088 under CC BY-SA 4.0; modifications have been made.

Words in each sectionFurther readingFurther readingFurther reading: 40 words40See alsoSee alsoSee also: 19 words19
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001373695088 · captured 2026-09-07 · ledger · version history

Cite this page as: encyclopegia.org, “Intersection (geometry)”, snapshot enwiki-001373695088. https://encyclopegia.org/a/intersection-geometry

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.