Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Intersection curve
open-in-new
<h2 id="intersection-line-of-two-planes">Intersection line of two planes</h2> <p>Given: two planes ε i : n → i ⋅ x → = d i , i = 1 , 2 , n → 1 , n → 2 {\displaystyle \varepsilon _{i}:\quad {\vec {n}}_{i}\cdot {\vec {x}}=d_{i},\quad i=1,2,\quad {\vec {n}}_{1},{\vec {n}}_{2}} <a href="/facts/Linearly_independent/8JrHfIIa">linearly independent</a>, i.e. the planes are not parallel. </p><p>Wanted: A parametric representation x → = p → + t r → {\displaystyle {\vec {x}}={\vec {p}}+t{\vec {r}}} of the intersection line. </p><p>The direction of the line one gets from the <a href="/facts/Crossproduct/uRBJzkcW">crossproduct</a> of the normal vectors: r → = n → 1 × n → 2 {\displaystyle {\vec {r}}={\vec {n}}_{1}\times {\vec {n}}_{2}} . </p><p>A point P : p → {\displaystyle P:{\vec {p}}} of the intersection line can be determined by intersecting the given planes ε 1 , ε 2 {\displaystyle \varepsilon _{1},\varepsilon _{2}} with the plane ε 3 : x → = s 1 n → 1 + s 2 n → 2 {\displaystyle \varepsilon _{3}:{\vec {x}}=s_{1}{\vec {n}}_{1}+s_{2}{\vec {n}}_{2}} , which is perpendicular to ε 1 {\displaystyle \varepsilon _{1}} and ε 2 {\displaystyle \varepsilon _{2}} . Inserting the parametric representation of ε 3 {\displaystyle \varepsilon _{3}} into the equations of ε 1 {\displaystyle \varepsilon _{1}} und ε 2 {\displaystyle \varepsilon _{2}} yields the parameters s 1 {\displaystyle s_{1}} and s 2 {\displaystyle s_{2}} . </p><p> P : p → = d 1 ( n → 2 ⋅ n → 2 ) − d 2 ( n → 1 ⋅ n → 2 ) ( n → 1 ⋅ n → 1 ) ( n → 2 ⋅ n → 2 ) − ( n → 1 ⋅ n → 2 ) 2 n → 1 + d 2 ( n → 1 ⋅ n → 1 ) − d 1 ( n → 1 ⋅ n → 2 ) ( n → 1 ⋅ n → 1 ) ( n → 2 ⋅ n → 2 ) − ( n → 1 ⋅ n → 2 ) 2 n → 2 . {\displaystyle P:{\vec {p}}={\frac {d_{1}({\vec {n}}_{2}\cdot {\vec {n}}_{2})-d_{2}({\vec {n}}_{1}\cdot {\vec {n}}_{2})}{({\vec {n}}_{1}\cdot {\vec {n}}_{1})({\vec {n}}_{2}\cdot {\vec {n}}_{2})-({\vec {n}}_{1}\cdot {\vec {n}}_{2})^{2}}}{\vec {n}}_{1}+{\frac {d_{2}({\vec {n}}_{1}\cdot {\vec {n}}_{1})-d_{1}({\vec {n}}_{1}\cdot {\vec {n}}_{2})}{({\vec {n}}_{1}\cdot {\vec {n}}_{1})({\vec {n}}_{2}\cdot {\vec {n}}_{2})-({\vec {n}}_{1}\cdot {\vec {n}}_{2})^{2}}}{\vec {n}}_{2}\ .} </p><p><i>Example:</i> ε 1 : x + 2 y + z = 1 , ε 2 : 2 x − 3 y + 2 z = 2 . {\displaystyle \varepsilon _{1}:\ x+2y+z=1,\quad \varepsilon _{2}:\ 2x-3y+2z=2\ .} </p><p>The normal vectors are n → 1 = ( 1 , 2 , 1 ) ⊤ , n → 2 = ( 2 , − 3 , 2 ) ⊤ {\displaystyle {\vec {n}}_{1}=(1,2,1)^{\top },\ {\vec {n}}_{2}=(2,-3,2)^{\top }} and the direction of the intersection line is r → = n → 1 × n → 2 = ( 7 , 0 , − 7 ) ⊤ {\displaystyle {\vec {r}}={\vec {n}}_{1}\times {\vec {n}}_{2}=(7,0,-7)^{\top }} . For point P : p → {\displaystyle P:{\vec {p}}} , one gets from the formula above p → = 1 2 ( 1 , 0 , 1 ) ⊤ . {\displaystyle {\vec {p}}={\tfrac {1}{2}}(1,0,1)^{\top }\ .} Hence </p> x → = 1 2 ( 1 , 0 , 1 ) ⊤ + t ( 7 , 0 , − 7 ) ⊤ {\displaystyle {\vec {x}}={\tfrac {1}{2}}(1,0,1)^{\top }+t(7,0,-7)^{\top }} <p>is a parametric representation of the line of intersection. </p><p><i>Remarks:</i> </p> <ol><li>In special cases, the determination of the intersection line by the <a href="/facts/Gaussian_elimination/23Rvf4ht">Gaussian elimination</a> may be faster.</li> <li>If one (or both) of the planes is given parametrically by x → = p → + s v → + t w → {\displaystyle {\vec {x}}={\vec {p}}+s{\vec {v}}+t{\vec {w}}} , one gets n → = v → × w → {\displaystyle {\vec {n}}={\vec {v}}\times {\vec {w}}} as normal vector and the equation is: n → ⋅ x → = n → ⋅ p → {\displaystyle {\vec {n}}\cdot {\vec {x}}={\vec {n}}\cdot {\vec {p}}} .</li></ol> <h2 id="intersection-curve-of-a-plane-and-a-quadric">Intersection curve of a plane and a quadric</h2> <p>In any case, the intersection curve of a plane and a quadric (sphere, cylinder, cone,...) is a <a href="/facts/Conic_section/teqgLptX">conic section</a>. For details, see.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> An important application of plane sections of quadrics is contour lines of quadrics. In any case (parallel or central projection), the contour lines of quadrics are conic sections. See below and Umrisskonstruktion. </p> <h2 id="intersection-curve-of-a-cylinder-or-cone-and-a-quadric">Intersection curve of a cylinder or cone and a quadric</h2> <p>It is an easy task to determine the intersection points of a line with a quadric (i.e. <a href="/facts/Line-sphere_intersection/rLgqJfMC">line-sphere</a>); one only has to solve a quadratic equation. So, any intersection curve of a cone or a cylinder (they are generated by lines) with a quadric consists of intersection points of lines and the quadric (see pictures). </p><p>The pictures show the possibilities which occur when intersecting a cylinder and a sphere: </p> <ol><li>In the first case, there exists just one intersection curve.</li> <li>The second case shows an example where the intersection curve consists of two parts.</li> <li>In the third case, the sphere and cylinder touch each other at one singular point. The intersection curve is self-intersecting.</li> <li>If the cylinder and sphere have the same radius and the midpoint of the sphere is located on the axis of the cylinder, then the intersection curve consists of singular points (a circle) only.</li></ol> <h2 id="general-case-marching-method">General case: marching method</h2> <p>In general, there are no special features to exploit. One possibility to determine a polygon of points of the intersection curve of two surfaces is the marching method (see section References). It consists of two essential parts: </p> <ol><li>The first part is the <i>curve point algorithm</i>, which determines to a starting point in the vicinity of the two surfaces a point on the intersection curve. The algorithm depends essentially on the representation of the given surfaces. The simplest situation is where both surfaces are implicitly given by equations f 1 ( x , y , z ) = 0 , f 2 ( x , y , z ) = 0 {\displaystyle f_{1}(x,y,z)=0,\ f_{2}(x,y,z)=0} , because the functions provide information about the distances to the surfaces and show via the gradients the way to the surfaces. If one or both the surfaces are parametrically given, the advantages of the implicit case do not exist. In this case, the curve point algorithm uses time-consuming procedures like the determination of the footpoint of a <a href="/facts/Perpendicular/u0k8xqx4">perpendicular</a> on a surface.</li> <li>The second part of the marching method starts with a first point on the intersection curve, determines the direction of the intersection curve using the surface normals, then makes a step with a given step length into the direction of the tangent line, in order to get a starting point for a second curve point, ... (see picture).</li></ol> <p>For details of the marching algorithm, see.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> </p><p>The marching method produces for any starting point a polygon on the intersection curve. If the intersection curve consists of two parts, the algorithm has to be performed using a second convenient starting point. The algorithm is rather robust. Usually, singular points are no problem, because the chance to meet exactly a singular point is very small (see picture: intersection of a cylinder and the surface x 4 + y 4 + z 4 = 1 {\displaystyle x^{4}+y^{4}+z^{4}=1} ). </p> <h2 id="application-contour-line">Application: contour line</h2> <p class="note">Main article: <a href="/facts/Contour_line/35Qten5r">Contour line</a></p> <p>A point ( x , y , z ) {\displaystyle (x,y,z)} of the contour line of an implicit surface with equation f ( x , y , z ) = 0 {\displaystyle f(x,y,z)=0} and parallel projection with direction v → {\displaystyle {\vec {v}}} has to fulfill the condition g ( x , y , z ) = ∇ f ( x , y , z ) ⋅ v → = 0 {\displaystyle g(x,y,z)=\nabla f(x,y,z)\cdot {\vec {v}}=0} , because v → {\displaystyle {\vec {v}}} has to be a tangent vector, which means any contour point is a point of the intersection curve of the two implicit surfaces </p> f ( x , y , z ) = 0 , g ( x , y , z ) = 0 {\displaystyle f(x,y,z)=0,\ g(x,y,z)=0} . <p>For quadrics, g {\displaystyle g} is always a linear function. Hence the contour line of a quadric is always a plane section (i.e. a conic section). </p><p>The contour line of the surface f ( x , y , z ) = x 4 + y 4 + z 4 − 1 = 0 {\displaystyle f(x,y,z)=x^{4}+y^{4}+z^{4}-1=0} (see picture) was traced by the marching method. </p><p><i>Remark:</i> The determination of a contour polygon of a parametric surface x → = x → ( s , t ) {\displaystyle {\vec {x}}={\vec {x}}(s,t)} needs tracing an implicit curve in parameter plane.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> </p> Condition for contour points: g ( s , t ) = ( x → s ( s , t ) × x → t ( s , t ) ) ⋅ v → = 0 {\displaystyle g(s,t)=({\vec {x}}_{s}(s,t)\times {\vec {x}}_{t}(s,t))\cdot {\vec {v}}=0} . <h2 id="intersection-curve-of-two-polyhedrons">Intersection curve of two polyhedrons</h2> <p>The intersection curve of two polyhedrons is a polygon (see intersection of three houses). The display of a parametrically defined surface is usually done by mapping a rectangular net into 3-space. The spatial quadrangles are nearly flat. So, for the intersection of two parametrically defined surfaces, the algorithm for the intersection of two polyhedrons can be used.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> See picture of intersecting tori. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Intersection_theory/UgckwVGF">Intersection theory</a></li></ul> <h2 id="further-reading">Further reading</h2> <ul><li>C:L: Bajaj, C.M. Hoffmann, R.E. Lynch: <i>Tracing surface intersections</i>, Comp. Aided Geom. Design 5 (1988), p. 285-307.</li> <li>R.E. Barnhill, S.N. Kersey: <i>A Marching method for parametric surface/surface intersection</i>, Comp. Aided Geom. Design 7 (1990), p. 257-280.</li> <li>R. Barnhill, G. Farin, M. Jordan, B. Piper: <i>Surface/Surface intersection</i>, Computer Aided Geometric Design 4 (1987), p 3-16.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 94 <a href="http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf" target="_blank">http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>CDKG: Computerunterstützte Darstellende und Konstruktive Geometrie (TU Darmstadt) (PDF; 3,4 MB), p. 87–124 <a href="http://www.mathematik.tu-darmstadt.de/~ehartmann/cdg-skript-1998.pdf" target="_blank">http://www.mathematik.tu-darmstadt.de/~ehartmann/cdg-skript-1998.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 94 <a href="http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf" target="_blank">http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Geometry and Algorithms for COMPUTER AIDED DESIGN, p. 99 <a href="http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf" target="_blank">http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Geometry and Algorithms for COMPUTER AIDED DESIGN p. 76 <a href="http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf" target="_blank">http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> </ol>