|
|
| Line 1: |
Line 1: |
| In [[geometry]], an '''intersection curve ''' is in the most simple case the intersection line of two non parallel planes in Euclidean 3-space. In General an intersection curve consists of the common points of two ''transversaly'' intersecting [[surface]]s. Transversaly means, that at any common point the [[surface normal]]s are not parallel. This restriction excludes cases, where the surfaces are touching or have surface parts in common.
| | Sportspersons Danilo Grippo from Timmins, loves to spend some time four, property developers in singapore and dominoes. Finds inspiration through travel and just spent 3 days at Tino and Tinetto).<br><br>Feel free to visit my site - [http://www.officefriendly.Co.uk/?option=com_k2&view=itemlist&task=user&id=67801 condominiums for sale] |
| | |
| [[File:Is-plane-plane.png|250px|thumb|intersection of two planes]]
| |
| | |
| The analytic determination of the intersection curve of two surfaces is easy in simple cases only. For example: a) intersection of two planes, b) plane section of a [[quadric]] (sphere, cylinder, cone,..), c) intersection of two quadrics in special cases. For the general case literature provides algorithms, in order to calculate points of the intersection curve of two surfaces.<ref>[http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf ''Geometry and Algorithms for COMPUTER AIDED DESIGN''], p. 94</ref>
| |
| | |
| == Intersection line of two planes ==
| |
| Given: two planes <math>\varepsilon_i: \quad \vec n_i\cdot\vec x=d_i, \quad i=1,2, \quad
| |
| \vec n_1,\vec n_2</math> [[linearly independent]], i.e. the planes are not parallel.<br />
| |
| Wanted: A parametric representation <math>\vec x= \vec p + t\vec r</math> of the intersection line.
| |
| | |
| The direction of the line we get from the [[crossproduct]] of the normal vectors: <math>\vec r=\vec n_1\times\vec n_2</math>.
| |
| | |
| A point <math>P:\vec p</math> of the intersection line can be determined by intersecting the given planes <math>\varepsilon_1, \varepsilon_2</math> with plane <math>\varepsilon_3: \vec x = s_1\vec n_1 + s_2\vec n_2</math>, which is perpendicular to <math>\varepsilon_1 </math> und <math> \varepsilon_2</math>. Inserting the parametric representation of <math>\varepsilon_3</math> into the equations of <math>\varepsilon_1</math> und <math>\varepsilon_2</math> yields the parameters <math>s_1</math> und <math>s_2</math>.
| |
| | |
| <math>P: \vec p= \frac{ d_1\vec n_2^2-d_2(\vec n_1\cdot \vec n_2)}
| |
| {\vec n_1^2\vec n_2^2-(\vec n_1\cdot\vec n_2)^2} \vec n_1
| |
| + \frac{ d_2 \vec n_1^2-d_1(\vec n_1\cdot\vec n_2)}{\vec n_1^2\vec n_2^2-(\vec n_1\cdot\vec n_1)^2} \vec n_2\ .</math>
| |
| | |
| ''Example:''
| |
| <math>\varepsilon_1:\ x+2y+z=1, \quad \varepsilon_2:\ 2x-3y+2z=2 \ .</math>
| |
| | |
| The normal vectors are <math>\vec n_1=(1,2,1)^\top, \ \vec n_2=(2,-3,2)^\top </math> and the direction of the intersection line is
| |
| <math>\vec r=\vec n_1\times\vec n_2=(7,0,-7)^\top</math>. For point <math>P:\vec p</math> we get from the formular above <math>\vec p=\tfrac{1}{2}(1,0,1)^\top \ .</math> Hence
| |
| :<math>\vec x=\tfrac{1}{2}(1,0,1)^\top + t (7,0,-7)^\top</math>
| |
| is a parametric representaion of the line of intersection.
| |
| | |
| ''Remark:''
| |
| #In special cases the determination of the intersection line by the [[Gaussian elimination]] may be faster.
| |
| #If one (or both) of the planes is given parametricaly by <math> \vec x= \vec p + s\vec v + t \vec w </math>, one gets <math> \vec n = \vec v \times \vec w </math> as normal vector and the equation is : <math> \vec n\cdot \vec x = \vec n\cdot \vec p</math>.
| |
| | |
| == Intersection curve of a plane and a quadric ==
| |
| In any case the intersection curve of a plane and a quadric (sphere, cylinder, cone,...) is a [[conic section]]. For details see.<ref>[http://www.mathematik.tu-darmstadt.de/~ehartmann/cdg-skript-1998.pdf CDKG: Computerunterstützte Darstellende und Konstruktive Geometrie (TU Darmstadt)] (PDF; 3,4 MB), p. 87-124</ref> An important application of plane sections of quadrics are contour lines of quadrics. In any case (parallel or central projection) the contour lines of quadrics are conic sections. See below and [https://de.wikipedia.org/wiki/Umrisskonstruktion Umrisskonstruktion].
| |
| | |
| == Intersection curve of a cylinder/cone and a quadric ==
| |
| It is an easy task to determine the intersection points of a line with a quadric (i.e. [[Line-sphere intersection|line-sphere]]). One has to solve just 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 (s. pictures).
| |
| | |
| The pictures show the possibility, which occur while intersecting a cylinder and a sphere:
| |
| #In the first case there exists just one intersection curve.
| |
| #The second case shows an example where the intersection curve consists of two parts.
| |
| #In the third case sphere and cylinder touch each other in one singular point. The intersection curve is self intersecting.
| |
| #If 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.
| |
|
| |
| <gallery widths="200" heights="175"> | |
| File:Is-spherecyl5.png|intersection of a sphere and a cylinder: 1 part
| |
| File:Is-spherecyl4.png|intersection of a sphere and a cylinder: 2 parts
| |
| </gallery>
| |
| <gallery widths="200" heights="175"> | |
| File:Is-spherecyl-sing.png|intersection of a sphere and a cylinder: curve with 1 sigular point
| |
| File:Is-spherecyl3.png|intersection of a sphere and a cylinder: touching in a singular curve
| |
| </gallery>
| |
| | |
| == General case: marching method ==
| |
| [[File:Is-algor.png|350px|thumb|intersection curve: principle of the marching algorithm]]
| |
| 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. It consists of two essential parts:
| |
| #The first part is the ''curve point algorithm'', which determines to a starting point in the vicinity of the two surfaces a point on the intersection curve. The algorithm depends essentialy on the representation of the given surfaces. The most simple situation is: both surfaces are implicitely given by equations <math>f_1(x,y,z)=0,\ f_2(x,y,z)=0</math>. Because the functions provide informations 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 [[perpendicular]] on a surface.
| |
| #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 one 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, ... (s. picture).
| |
| | |
| For details of the marching algorithm: see.<ref>[http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf ''Geometry and Algorithms for COMPUTER AIDED DESIGN''], p. 94</ref>
| |
| | |
| The marching method produces to any starting point a polygon on the intersection curve. If the intersection curve consists of 2 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 <math>x^4+y^4+z^4=1</math>).
| |
| | |
| <gallery widths="200" heights="175">
| |
| File:Is-sphere4cyl1.png|intersection of <math>x^4+y^4+z^4=1</math> with cylinder: 2 parts
| |
| File:Is-sphere4cyl2.png|intersection of <math>x^4+y^4+z^4=1</math> with cylinder: 1 part
| |
| File:Is-sphere4cyl3.png|intersection of <math>x^4+y^4+z^4=1</math> with cylinder: 1 singular point
| |
| </gallery>
| |
| | |
| == Application: contour line ==
| |
| A point <math>(x,y,z)</math> of the contour line of an implicit surface with equation <math>f(x,y,z)=0</math>
| |
| and parallel projection with direction <math>\vec v</math> has to fulfill the condition <math>g(x,y,z)=\nabla f(x,y,z)\cdot \vec v=0</math>, because <math>\vec v</math> has to be a tangent vector. That means any contour point is a point of the intersection curve of the two implicit surfaces
| |
| : <math>f(x,y,z)=0 ,\ g(x,y,z)=0</math>.
| |
| For quadrics <math>g</math> is always a linear function. Hence the contour line of a quadric is always a plane section (i.e. conic section).
| |
| | |
| The contour line of the surface <math>f(x,y,z)=x^4+y^4+z^4-1=0</math> (s. picture) was traced by the marching method.
| |
| | |
| ''Remark:'' The determination of a contour polygon of a parametric surface <math> \vec x = \vec x(s,t)</math> needs tracing an implicit curve in parameter plane.<ref>[http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf ''Geometry and Algorithms for COMPUTER AIDED DESIGN''], p. 99</ref>
| |
| : Condition for contour points: <math>g(s,t)=(\vec x_s(s,t)\times \vec x_t(s,t))\cdot \vec v=0</math>.
| |
| | |
| == Intersection curve of two polyhedrons == | |
| [[File:Is-houses.png|thumb|intersection curve between polyhedrons: 3 houses]]
| |
| [[File:Is-tori.png|300px|thumb|intersection of polyhedrons: 2 tori]]
| |
| The intersection curve of two polyhedrons is a polygon (see intersection of 3 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.<ref>[http://www.mathematik.tu-darmstadt.de/~ehartmann/cdgen0104.pdf ''Geometry and Algorithms for COMPUTER AIDED DESIGN''] p. 76</ref> See picure of intersecting tori.
| |
| | |
| == See also ==
| |
| | |
| * [[Intersection point]]
| |
| | |
| == References ==
| |
| <references />
| |
| | |
| [[Category:Euclidean geometry]]
| |
| [[Category:Linear algebra]]
| |
Sportspersons Danilo Grippo from Timmins, loves to spend some time four, property developers in singapore and dominoes. Finds inspiration through travel and just spent 3 days at Tino and Tinetto).
Feel free to visit my site - condominiums for sale