Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Intersection (geometry)

From Wikipedia, the free encyclopedia
Shape formed from points common to other shapes
For broader coverage of this topic, seeIntersection (mathematics).
The red dot represents the point at which the two lines intersect.

Ingeometry, anintersection is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces). The simplest case inEuclidean geometry is theline–line intersection between two distinctlines, which either is onepoint (sometimes called avertex) or does not exist (if the lines areparallel). Other types of geometric intersection include:

Determination of the intersection offlats – linear geometric objects embedded in a higher-dimensional space – is a simple task oflinear algebra, namely the solution of asystem of linear equations. In general the determination of an intersection leads tonon-linear equations, which can besolved numerically, for example usingNewton iteration. Intersection problems between a line and aconic section (circle, ellipse, parabola, etc.) or aquadric (sphere, cylinder, hyperboloid, etc.) lead toquadratic equations that can be easily solved. Intersections between quadrics lead toquartic equations that can be solvedalgebraically.

On a plane

[edit]
Further information:Plane (geometry) andTwo-dimensional space

Two lines

[edit]
Main article:Line–line intersection

For the determination of the intersection point of two non-parallel lines

a1x+b1y=c1, a2x+b2y=c2{\displaystyle a_{1}x+b_{1}y=c_{1},\ a_{2}x+b_{2}y=c_{2}}

one gets, fromCramer's rule or by substituting out a variable, the coordinates of the intersection point(xs,ys){\displaystyle (x_{s},y_{s})} :

xs=c1b2c2b1a1b2a2b1,ys=a1c2a2c1a1b2a2b1. {\displaystyle x_{s}={\frac {c_{1}b_{2}-c_{2}b_{1}}{a_{1}b_{2}-a_{2}b_{1}}},\quad y_{s}={\frac {a_{1}c_{2}-a_{2}c_{1}}{a_{1}b_{2}-a_{2}b_{1}}}.\ }

(Ifa1b2a2b1=0{\displaystyle a_{1}b_{2}-a_{2}b_{1}=0} the lines are parallel and these formulas cannot be used because they involve dividing by 0.)

Two line segments

[edit]
See also:Multiple line segment intersection andLine–line intersection § Given two points on each line segment
Intersection of two line segments

For two non-parallelline segments(x1,y1),(x2,y2){\displaystyle (x_{1},y_{1}),(x_{2},y_{2})} and(x3,y3),(x4,y4){\displaystyle (x_{3},y_{3}),(x_{4},y_{4})} there is not necessarily an intersection point (see diagram), because the intersection point(x0,y0){\displaystyle (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))=(x1+s(x2x1),y1+s(y2y1)),{\displaystyle (x(s),y(s))=(x_{1}+s(x_{2}-x_{1}),y_{1}+s(y_{2}-y_{1})),}
(x(t),y(t))=(x3+t(x4x3),y3+t(y4y3)).{\displaystyle (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(x0,y0){\displaystyle (x_{0},y_{0})} of the corresponding lines if the corresponding parameterss0,t0{\displaystyle s_{0},t_{0}} fulfill the condition0s0,t01{\displaystyle 0\leq s_{0},t_{0}\leq 1}. The parameterss0,t0{\displaystyle s_{0},t_{0}} are the solution of the linear system

s(x2x1)t(x4x3)=x3x1,{\displaystyle s(x_{2}-x_{1})-t(x_{4}-x_{3})=x_{3}-x_{1},}
s(y2y1)t(y4y3)=y3y1 .{\displaystyle s(y_{2}-y_{1})-t(y_{4}-y_{3})=y_{3}-y_{1}\ .}

It can be solved fors andt using Cramer's rule (seeabove). If the condition0s0,t01{\displaystyle 0\leq s_{0},t_{0}\leq 1} is fulfilled one insertss0{\displaystyle s_{0}} ort0{\displaystyle t_{0}} into the corresponding parametric representation and gets the intersection point(x0,y0){\displaystyle (x_{0},y_{0})}.

Example: For the line segments(1,1),(3,2){\displaystyle (1,1),(3,2)} and(1,4),(2,1){\displaystyle (1,4),(2,-1)} one gets the linear system

2st=0{\displaystyle 2s-t=0}
s+5t=3{\displaystyle s+5t=3}

ands0=311,t0=611{\displaystyle s_{0}={\tfrac {3}{11}},t_{0}={\tfrac {6}{11}}}. That means: the lines intersect at point(1711,1411){\displaystyle ({\tfrac {17}{11}},{\tfrac {14}{11}})}.

Remark: Considering lines, instead of segments, determined by pairs of points, each condition0s0,t01{\displaystyle 0\leq s_{0},t_{0}\leq 1} can be dropped and the method yields the intersection point of the lines (seeabove).

A line and a circle

[edit]
Further information:Line–sphere intersection
Line–circle intersection

For the intersection of

one solves the line equation forx ory andsubstitutes it into the equation of the circle and gets for the solution (using the formula of a quadratic equation)(x1,y1),(x2,y2){\displaystyle (x_{1},y_{1}),(x_{2},y_{2})} with

x1/2=ac±br2(a2+b2)c2a2+b2 ,{\displaystyle x_{1/2}={\frac {ac\pm b{\sqrt {r^{2}(a^{2}+b^{2})-c^{2}}}}{a^{2}+b^{2}}}\ ,}
y1/2=bcar2(a2+b2)c2a2+b2 ,{\displaystyle y_{1/2}={\frac {bc\mp a{\sqrt {r^{2}(a^{2}+b^{2})-c^{2}}}}{a^{2}+b^{2}}}\ ,}

ifr2(a2+b2)c2>0 .{\displaystyle 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 asecant line of the circle, and the line segment connecting the intersection points is called achord of the circle.

Ifr2(a2+b2)c2=0{\displaystyle 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.

If the circle's midpoint is not the origin, see.[1] The intersection of a line and a parabola or hyperbola may be treated analogously.

Two circles

[edit]
See also:Lens (geometry)

The determination of the intersection points of two circles

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(x2x1)x+2(y2y1)y=r12x12y12r22+x22+y22.{\displaystyle 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 theradical line of the two circles.

Intersection of two circles with centers on the x-axis, their radical line is dark red

Special casex1=y1=y2=0{\displaystyle \;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 to2x2x=r12r22+x22{\displaystyle \;2x_{2}x=r_{1}^{2}-r_{2}^{2}+x_{2}^{2}\;} and the points of intersection can be written as(x0,±y0){\displaystyle (x_{0},\pm y_{0})} with

x0=r12r22+x222x2,y0=r12x02 .{\displaystyle 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 ofr12<x02{\displaystyle r_{1}^{2}<x_{0}^{2}} the circles have no points in common.
In case ofr12=x02{\displaystyle 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 twodisks (the interiors of the two circles) forms a shape called alens.

circle–ellipse intersection

Two conic sections

[edit]

The problem of intersection of an ellipse/hyperbola/parabola with anotherconic section leads to asystem 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 asolution. 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

[edit]
A transversal intersection of two curves
touching intersection (left), touching (right)

Two curves inR2{\displaystyle \mathbb {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, aftertransversality), or
b) the tangent line in common and they are crossing each other (touching intersection, aftertangency).

If both the curves have a pointS and the tangent line there in common but do not cross each other, they are justtouching at pointS.

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:

intersection of a parametric curve and an implicit curve
intersection of two implicit curves
f1(x)=f2(x) .{\displaystyle f_{1}(x)=f_{2}(x)\ .}
Equating them yields two equations in two variables:
x1(t)=x2(s), y1(t)=y2(s) .{\displaystyle x_{1}(t)=x_{2}(s),\ y_{1}(t)=y_{2}(s)\ .}
This is the simplest case besides the explicit case. One has to insert the parametric representation ofC1{\displaystyle C_{1}} into the equationf(x,y)=0{\displaystyle f(x,y)=0} of curveC2{\displaystyle C_{2}} and one gets the equation:
f(x1(t),y2(t))=0 .{\displaystyle f(x_{1}(t),y_{2}(t))=0\ .}
Here, an intersection point is a solution of the system
f1(x,y)=0, f2(x,y)=0 .{\displaystyle 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 parametert orx 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.[2]

Examples:

1:C1:(t,t3){\displaystyle C_{1}:(t,t^{3})} and circleC2:(x1)2+(y1)210=0{\displaystyle C_{2}:(x-1)^{2}+(y-1)^{2}-10=0} (see diagram).
The Newton iterationtn+1:=tnf(tn)f(tn){\displaystyle t_{n+1}:=t_{n}-{\frac {f(t_{n})}{f'(t_{n})}}} for function
f(t)=(t1)2+(t31)210{\displaystyle 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:C1:f1(x,y)=x4+y41=0,{\displaystyle C_{1}:f_{1}(x,y)=x^{4}+y^{4}-1=0,}
C2:f2(x,y)=(x0.5)2+(y0.5)21=0{\displaystyle C_{2}:f_{2}(x,y)=(x-0.5)^{2}+(y-0.5)^{2}-1=0} (see diagram).
The Newton iteration
(xn+1yn+1)=(xn+δxyn+δy){\displaystyle {x_{n+1} \choose y_{n+1}}={x_{n}+\delta _{x} \choose y_{n}+\delta _{y}}} has to be performed, where(δxδy){\displaystyle {\delta _{x} \choose \delta _{y}}} is the solution of the linear system
(f1xf1yf2xf2y)(δxδy)=(f1f2){\displaystyle {\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(xn,yn){\displaystyle (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

[edit]
intersection of two polygons: window test

If one wants to determine the intersection points of twopolygons, one can check the intersection of any pair of line segments of the polygons (seeabove). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by usingwindow 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.[3]

In space (three dimensions)

[edit]
Further information:three-dimensional space

In 3-dimensional space there are intersection points (common points) between curves and surfaces. In the following sections we considertransversal intersection only.

A line and a plane

[edit]
Main article:Line–plane intersection
Line–plane intersection

The intersection of a line and a planeingeneral position in three dimensions is a point.

Commonly a line in space is represented parametrically(x(t),y(t),z(t)){\displaystyle (x(t),y(t),z(t))} and a plane by an equationax+by+cz=d{\displaystyle ax+by+cz=d}. Inserting the parameter representation into the equation yields the linear equation

ax(t)+by(t)+cz(t)=d ,{\displaystyle ax(t)+by(t)+cz(t)=d\ ,}

for parametert0{\displaystyle t_{0}} of the intersection point(x(t0),y(t0),z(t0)){\displaystyle (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.

Three planes

[edit]

If a line is defined by two intersecting planesεi: nix=di, i=1,2{\displaystyle \varepsilon _{i}:\ {\vec {n}}_{i}\cdot {\vec {x}}=d_{i},\ i=1,2} and should be intersected by a third planeε3: n3x=d3{\displaystyle \varepsilon _{3}:\ {\vec {n}}_{3}\cdot {\vec {x}}=d_{3}}, the common intersection point of the three planes has to be evaluated.

Three planesεi: nix=di, i=1,2,3{\displaystyle \varepsilon _{i}:\ {\vec {n}}_{i}\cdot {\vec {x}}=d_{i},\ i=1,2,3} with linear independent normal vectorsn1,n2,n3{\displaystyle {\vec {n}}_{1},{\vec {n}}_{2},{\vec {n}}_{3}} have the intersection point

p0=d1(n2×n3)+d2(n3×n1)+d3(n1×n2)n1(n2×n3) .{\displaystyle {\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 establishnip0=di, i=1,2,3,{\displaystyle {\vec {n}}_{i}\cdot {\vec {p}}_{0}=d_{i},\ i=1,2,3,} using the rules of ascalar 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).

A curve and a surface

[edit]
intersection of curve(t,t2,t3){\displaystyle (t,t^{2},t^{3})} with surfacex4+y4+z4=1{\displaystyle x^{4}+y^{4}+z^{4}=1}

Analogously to the plane case the following cases lead to non-linear systems, which can be solved using a 1- or 3-dimensional Newton iteration.[4]

parametric surfaceS:(x(u,v),y(u,v),z(u,v)) ,{\displaystyle S:(x(u,v),y(u,v),z(u,v))\ ,}
implicit surfaceS:f(x,y,z)=0 .{\displaystyle S:f(x,y,z)=0\ .}

Example:

parametric curveC:(t,t2,t3){\displaystyle C:(t,t^{2},t^{3})} and
implicit surfaceS:x4+y4+z41=0{\displaystyle 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).

Aline–sphere intersection is a simple special case.

Like the case of a line and a plane, the intersection of a curve and a surfaceingeneral position consists of discrete points, but a curve may be partly or totally contained in a surface.

A line and a polyhedron

[edit]
Main article:Intersection of a polyhedron with a line

Two surfaces

[edit]
Main article:Intersection curve

Two transversally intersecting surfaces give anintersection curve. The most simple case is the intersection line of two non-parallel planes.

A sphere and a plane

[edit]
See also:Spherical circle

When the intersection of a sphere and a plane is not empty or a single point, it is a circle. This can be seen as follows:

LetS be a sphere with centerO,P a plane which intersectsS. DrawOE perpendicular toP and meetingP atE. LetA andB be any two different points in the intersection. ThenAOE andBOE are right triangles with a common side,OE, and hypotenusesAO andBO equal. Therefore, the remaining sidesAE andBE are equal. This proves that all points in the intersection are the same distance from the pointE in the planeP, in other words all points in the intersection lie on a circleC with centerE.[5] This proves that the intersection ofP andS is contained inC. Note thatOE is the axis of the circle.

Now consider a pointD of the circleC. SinceC lies inP, so doesD. On the other hand, the trianglesAOE andDOE are right triangles with a common side,OE, and legsEA andED equal. Therefore, the hypotenusesAO andDO are equal, and equal to the radius ofS, so thatD lies inS. This proves thatC is contained in the intersection ofP andS.

As a corollary, on a sphere there is exactly one circle that can be drawn through three given points.[6]

The proof can be extended to show that the points on a circle are all a common angular distance from one of its poles.[7]

Compare alsoconic sections, which can produceovals.

Two spheres

[edit]

To show that a non-trivial intersection of two spheres is a circle, assume (without loss of generality) that one sphere (with radiusR{\displaystyle R}) is centered at the origin. Points on this sphere satisfy

x2+y2+z2=R2.{\displaystyle x^{2}+y^{2}+z^{2}=R^{2}.}

Also without loss of generality, assume that the second sphere, with radiusr{\displaystyle r}, is centered at a point on the positive x-axis, at distancea{\displaystyle a} from the origin. Its points satisfy

(xa)2+y2+z2=r2.{\displaystyle (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

(xa)2x2=r2R2a22ax=r2R2x=a2+R2r22a.{\displaystyle {\begin{aligned}(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{aligned}}}

In the singular casea=0{\displaystyle a=0}, the spheres are concentric. There are two possibilities: ifR=r{\displaystyle R=r}, the spheres coincide, and the intersection is the entire sphere; ifRr{\displaystyle R\not =r}, the spheres are disjoint and the intersection is empty.Whena 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

[edit]

Notes

[edit]
  1. ^Erich Hartmann:Geometry and Algorithms for COMPUTER AIDED DESIGN. Lecture notes, Technische Universität Darmstadt, October 2003, p. 17
  2. ^Erich Hartmann:Geometry and Algorithms for COMPUTER AIDED DESIGN. Lecture notes, Technische Universität Darmstadt, October 2003, p. 33
  3. ^Erich Hartmann:CDKG: Computerunterstützte Darstellende und Konstruktive Geometrie. Lecture notes, TU Darmstadt, 1997, p. 79 (PDF; 3,4 MB)
  4. ^Erich Hartmann:Geometry and Algorithms for COMPUTER AIDED DESIGN. Lecture notes, Technische Universität Darmstadt, October 2003, p. 93
  5. ^Proof follows Hobbs, Prop. 304
  6. ^Hobbs, Prop. 308
  7. ^Hobbs, Prop. 310

References

[edit]

Further reading

[edit]
  • Haines, Eric (June 6, 2021)."Intersections (Ray Tracing Resources Page)".Real-Time Rendering. RetrievedDecember 14, 2023.a grid of intersection routines for various popular objects, pointing to resources in books and on the web.
  • Nicholas M. Patrikalakis and Takashi Maekawa,Shape Interrogation for Computer Aided Design and Manufacturing, Springer, 2002,ISBN 3540424547, 9783540424543, pp. 408.[1]
  • Sykes, M.; Comstock, C.E. (1922).Solid Geometry. Rand McNally. pp. 81 ff.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Intersection_(geometry)&oldid=1245067921"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp