Cyclic decomposition theorem

In geometry, an intersection is a point, line, or curve common in two or more objects (such as lines, curves, planes, and surfaces). The most simple case in Euclidean geometry is the intersection points of two distinct lines, that is either one point or does not exist if lines are parallel.

Determination of the intersection of flats is a simple task of linear algebra, namely 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 a Newton iteration. Intersection problems between a line and a conic section (circle, ellipse, parabola, ...) or a quadric (sphere, cylinder, hyperboloid, ...) lead to quadratic equations that can be easily solved. Intersections between quadrics lead to quartic equations that can be solved algebraically.

On a plane

47 year-old Podiatrist Hyslop from Alert Bay, has lots of hobbies and interests that include fencing, property developers in condo new launch singapore and handball. Just had a family trip to Monasteries of Haghpat and Sanahin.

Two lines

Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church. For the determination of the intersection point of two non-parallel lines

$a_{1} x + b_{1} y = c_{1}, a_{2} x + b_{2} y = c_{2}$

one gets from Cramer's rule for the coordinates of the intersection point $(x_{s}, y_{s})$

x_{s} = \frac{c_{1} b_{2} - c_{2} b_{1}}{a_{1} b_{2} - a_{2} b_{1}}, y_{s} = \frac{a_{1} c_{2} - a_{2} c_{1}}{a_{1} b_{2} - a_{2} b_{1}} .

(In case of $a_{1} b_{2} - a_{2} b_{1} = 0$ the lines are parallel.)

If the lines are given by two points each, see next section.

Two line segments

Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church.

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 no need for an intersection point (see picture), 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 \leq s_{0}, t_{0} \leq 1$ . The parametrs $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 using Cramer's rule (see above). If the condition $0 \leq s_{0}, t_{0} \leq 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

2 s - t = 0

s + 5 t = 3

and $s_{0} = \frac{3}{11}, t_{0} = \frac{6}{11}$ . That means: the lines intersect at point $(\frac{17}{11}, \frac{14}{11})$ .

Remark: Considering lines (not segments!) determined by pairs of points, each, condition $0 \leq s_{0}, t_{0} \leq 1$ can be skipped and the method yield the intersection point of the lines (see above).

A line and a circle

For the intersection of

line $a x + b y = c$ and circle $x^{2} + y^{2} = r^{2}$

one solves the line equation for Template:Mvar or Template:Mvar 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{a c \pm b \sqrt{r^{2} (a^{2} + b^{2}) - c^{2}}}{a^{2} + b^{2}},

y_{1 / 2} = \frac{b c \mp a \sqrt{r^{2} (a^{2} + b^{2}) - c^{2}}}{a^{2} + b^{2}},

if $r^{2} (a^{2} + b^{2}) - c^{2} \geq 0 .$
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.

Remark:

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

File:Is-circle-circle.png

circle–circle intersection

File:Is-circle-ellipse.png

circle–ellipse intersection

The determination of the intersection points of two circles

$(x - x_{1})^{2} + (y - y_{1})^{2} = r_{1}^{2}, (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} .

Two conic sections

The problem of intersection of an ellipse/hyperbola/parabola with another conic section leads to a system of quartic equations, which can be solved in special cases easily by elimination of one coordinate. 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 curves

File:Schnittp2d-transv.png

A transversal intersection of two curves

File:Beruehr-schnitt.png

touching intersection (left), touching (right)

Two curves in $ℝ^{2}$ , 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

a: different tangent lines (transversal intersection), or

b: the tangent line in common and they are crossing each other (touching intersection, s. picture).

If both the curves have a point Template:Mvar and the tangent line there in common but do not cross each other, they are just touching at point Template:Mvar.

Because touching intersection appears rarely and is 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 lead to 1 or 2 non-linear equations which can be solved by a Newton iteration. A list of the appearing cases follows:

File:Schnittp2d-pi.png

intersection of a parametric curve and an implicit curve

File:Schnittp2d-ii.png

intersection of two implicit curves

If both curves are explicitly given: $y = f_{1} (x), y = f_{2} (x)$ , equalizing 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)) .$

Equalizing yields two equations for 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 beside the explicit case the simplest 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 (t), y (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 Template:Mvar or Template:Mvar 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:

C_{1} : (t, t^{3})

and circle

C_{2} : (x - 1)^{2} + (y - 1)^{2} - 10 = 0

(s. picture).

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 startvalues 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

(s. picture).

The Newton iteration

(\binom{x_{n + 1}}{y_{n + 1}}) = (\binom{x_{n} + δ_{x}}{y_{n} + δ_{y}})

has to be performed, where

(\binom{δ_{x}}{δ_{y}})

is the solution of the linear system

(\begin{matrix} \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{matrix}) (\binom{δ_{x}}{δ_{y}}) = (\binom{- f_{1}}{- 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

File:Is-polygpolyg.png

intersection of two polygons: window test

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 a lot of segments this method is rather time consuming. In praxis 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.^[3]

In space (three dimensions)

Template:More information In 3-dimensional space there are intersection points (common points) between curves and surfaces. In the following sections we consider transversal intersection only.

A line and a plane

Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church.

File:Schnittp-ger-eb.png

Line–plane intersection

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

Commonly a line in space is represented parametrically $(x (t), y (t), z (t))$ and a plane by an equation $a x + b y + c z = d$ . Inserting the parameter representation into the equation yields the linear equation

a x (t) + b y (t) + c z (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.

Three planes

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

Three planes $ε_{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).

A curve and a surface

File:Is-pcurve-isurface.png

intersection of curve

(t, t^{2}, t^{3})

with surface

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 curve $C : (x (t), y (t), z (t)$ and

parametric surface

S : (x (u, v), y (u, v), z (u, v)),

parametric curve $C : (x (t), y (t), z (t)$ and

implicit surface

S : f (x, y, z) = 0 .

Example:

parametric curve

C : (t, t^{2}, t^{3})

und

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.

A line and a polyhedron

Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church.

Two surfaces

Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church. Two transversally intersecting surfaces give an intersection curve. The most simple case the intersection line of two non-parallel planes.

References

↑ Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 17
↑ Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 33
↑ CDKG: Computerunterstützte Darstellende und Konstruktive Geometrie (TU Darmstadt) (PDF; 3,4 MB), p. 79
↑ Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 93

[1] Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 17

[2] Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 33

[3] CDKG: Computerunterstützte Darstellende und Konstruktive Geometrie (TU Darmstadt) (PDF; 3,4 MB), p. 79

[4] Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 93

[1]

[2]

[3]

[4]

Cyclic decomposition theorem

Contents

On a plane

Two lines

Two line segments

A line and a circle

Two circles

Two conic sections

Two curves

Two polygons

In space (three dimensions)

A line and a plane

Three planes

A curve and a surface

A line and a polyhedron

Two surfaces

See also

References

Navigation menu

Cyclic decomposition theorem

On a plane

Two lines

Two line segments

A line and a circle

Two circles

Two conic sections

Two curves

Two polygons

In space (three dimensions)

A line and a plane

Three planes

A curve and a surface

A line and a polyhedron

Two surfaces

See also

References

Navigation menu

Search