Two lines For the determination of the intersection point of two non-parallel lines 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.)
Two line segments For two non-parallel
line segments (x_1,y_1),(x_2,y_2) and (x_3,y_3),(x_4,y_4) there is not necessarily an intersection point (see diagram), because the intersection point (x_0,y_0) of the corresponding lines need not to be contained in the line segments. In order to check the situation one uses parametric representations of the lines: : (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).
A line and a circle For the intersection of • 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.
Two circles The determination of the intersection points of two circles • (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.
Two conic sections The problem of intersection of an ellipse/hyperbola/parabola with another
conic section leads to a
system of quadratic equations, which can be solved in special cases easily by elimination of one coordinate. Special properties of conic sections may be used to obtain a
solution. In general the intersection points can be determined by solving the equation by a Newton iteration. If a) both conics are given implicitly (by an equation) a 2-dimensional Newton iteration b) one implicitly and the other parametrically given a 1-dimensional Newton iteration is necessary. See next section.
Two smooth curves Two curves in \R^2 (two-dimensional space), which are continuously differentiable (i.e. there is no sharp bend), have an intersection point, if they have a point of the plane in common and have at this point (see diagram): : a) different tangent lines (
transversal intersection, after
transversality), or : b) the tangent line in common and they are crossing each other (
touching intersection, after
tangency). If both the curves have a point and the tangent line there in common but do not cross each other, they are just
touching at point . Because touching intersections appear rarely and are difficult to deal with, the following considerations omit this case. In any case below all necessary differential conditions are presupposed. The determination of intersection points always leads to one or two non-linear equations which can be solved by Newton iteration. A list of the appearing cases follows: • 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).
Two polygons If one wants to determine the intersection points of two
polygons, one can check the intersection of any pair of line segments of the polygons (see
above). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by using
window tests. In this case one divides the polygons into small sub-polygons and determines the smallest window (rectangle with sides parallel to the coordinate axes) for any sub-polygon. Before starting the time-consuming determination of the intersection point of two line segments any pair of windows is tested for common points. See. == In space (three dimensions) ==