SlideShare a Scribd company logo
1 of 26
Download to read offline
Problem
  Distance of closest approach of two ellipses
 Distance of closest approach of two ellipsoids
                                  Conclusions




Computing the distance of closest approach
    between ellipses and ellipsoids

          F. Etayo, L. González-Vega, G. R. Quintana

          Departamento de MATemáticas, EStadística y COmputación
                       University of Cantabria, Spain




XII Encuentro de Álgebra Computacional y Aplicaciones,
    Santiago de Compostela, 19-21 de julio de 2010
   F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Contents


  1   Problem

  2   Distance of closest approach of two ellipses

  3   Distance of closest approach of two ellipsoids

  4   Conclusions




         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Introduction


  The distance of closest approach of two arbitrary separated
  ellipses (resp. ellipsoids) is the distance among their centers
  when they are externally tangent, after moving them through
  the line joining their centers.

  That distance appears when we study the problem of
  determining the distance of closest approach of hard particles
  which is a key topic in some physical questions like modeling
  and simulating systems of anisometric particles, such as liquid
  crystals, or in the case of interference analysis of molecules.



         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions


Introduction




              Distance of closest approach of two ellipses.



        F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Previous work

  A description of a method for solving the problem in the case of
  two arbitrary hard ellipses (resp. ellipsoids) can be found in

      X. Z HENG , P. PALFFY-M UHORAY, Distance of closest
      approach of two arbitrary hard ellipses in two dimensions,
      Phys. Rev., E 75, 061709, 2007.
      X. Z HENG , W. I GLESIAS , P. PALFFY-M UHORAY, Distance of
      closest approach of two arbitrary hard ellipsoids, Phys.
      Rev. E, 79, 057702, 2009.

  An analytic expression for that distance is given as a function of
  their orientation relative to the line joining their centers.

         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Previous work (Zheng,Palffy-Muhoray)
  Ellipses case:
   1   Two ellipses initially distant are given.
   2   One ellipse is translated toward the other along the line
       joining their centers until they are externally tangent.
   3   PROBLEM: to find the distance d between the centers at
       that time.
   4   Transformation of the two tangent ellipses into a circle and
       an ellipse.
   5   Determination of the distance d of closest approach of the
       circle and the ellipse.
   6   Determination of the distance d of closest approach of the
       initial ellipses by inverse transformation.

         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Previous work (Zheng,Palffy-Muhoray)
  Ellipses case:
   1   Two ellipses initially distant are given.
   2   One ellipse is translated toward the other along the line
       joining their centers until they are externally tangent.
   3   PROBLEM: to find the distance d between the centers at
       that time.
   4   Transformation of the two tangent ellipses into a circle and
       an ellipse. ⇒ Anisotropic scaling
   5   Determination of the distance d of closest approach of the
       circle and the ellipse.
   6   Determination of the distance d of closest approach of the
       initial ellipses by inverse transformation.

         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Previous work (Zheng,Iglesias,Palffy-Muhoray)

  Ellipsoids case:
   1   Two ellipsoids initially distant are given.
   2   Plane containing the line joining the centers of the two
       ellipsoids.
   3   Equations of the ellipses formed by the intersection of this
       plane and the ellipsoids.
   4   Determining the distance of closest approach of the
       ellipses
   5   Rotating the plane until the distance of closest approach of
       the ellipses is a maximum
   6   The distance of closest approach of the ellipsoids is this
       maximum distance

         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Previous work



  To deal with anisotropic scaling and the inverse transformation
  involves the calculus of the eigenvectors and eigenvalues of the
  matrix of the transformation.

  Our goal is to find when that computation is not required and if
  it is, to simplify it. The way in which we do that extends in a
  natural way the ellipsoids case.




         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Our approach


  We use the results shown in:
      F. E TAYO, L. G ONZ·LEZ -V EGA , N. DEL RÌ O, A new approach to
      characterizing the relative position of two ellipses depending on
      one parameter, Computed Aided Geometric Desing 23,
      324-350, 2006.
      W. WANG , R. K RASAUSKAS, Interference analysis of conics and
      quadrics, Contemporary Math. 334, 25-36,2003.
      W. WANG , J. WANG , M. S. K IM, An algebraic condition for the
      separation of two ellipsoids, Computer Aided Geometric Desing
      18, 531-539, 2001.




         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Our approach
  Following their notation we define

  Definition
  Let A and B be two ellipses (resp. ellipsoids) given by the equations
  X T AX = 0 and X T BX = 0 respectively, the degree three (resp.
  four) polynomial
                           f (λ) = det(λA + B)
  is called the characteristic polynomial of the pencil λA + B


       Two ellipses (or ellipsoids) are separated if and only if their
       characteristic polynomial has two distinct positive roots.
       The ellipses (or ellipsoids) touch each other externally if and
       only if the characteristic equation has a positive double root.


         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Our approach


  We use the previous characterization in order to obtain the
  solution of the problem.

  We give a closed formula for the polynomial S(t) (depending
  polynomially on the ellipse parameters) whose biggest real root
  provides the distance of closest approach:
      Ellipses case: d = t0                     x 2 + y0
                                                  0
                                                       2

      Ellipsoids case: d = t0                      x 2 + y0 + z0
                                                     0
                                                          2    2




         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
      Distance of closest approach of two ellipses
     Distance of closest approach of two ellipsoids
                                      Conclusions




We consider the two coplanar ellipses given by the equations:

E1 = (x, y) ∈ R2 : a22 x2 + a33 y 2 + 2a23 xy + 2a31 x + 2a32 y + a11 = 0

E2 = (x, y) ∈ R2 : b22 x2 + b33 y 2 + 2b23 xy + 2b31 x + 2b32 y + b11 = 0

We change the reference frame in order to have E1 centered at the
origin and E2 centered at (x0 , y0 ) with axis parallel to the coordinate
ones:
                            (x cos (α) + y sin (α))2   (x sin (α) − y cos (α))2
E1 =    (x, y) ∈ R2 :                                +                          =1
                                       a                           b

                                                (x − x0 )2   (y − y0 )2
                 E2 =       (x, y) ∈ R2 :                  +            =1
                                                    c            d




       F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
      Distance of closest approach of two ellipses
     Distance of closest approach of two ellipsoids
                                      Conclusions




Let A1 and A2 be the matrices associated to E1 and E2 .
Characteristic polynomial of the pencil λA2 + A1 :

             H(λ) = det(λA2 + A1 ) = h3 λ3 + h2 λ2 + h1 λ + h0

Compute the discriminant of H(λ), and introduce the change of
variable (x0 , y0 ) = (x0 t, y0 t). The equation which gives us the
searched value of t, t0 , is S(t) = 0 where:

  S(t) = discλ H(λ) |(x0 ,y0 )=(x0 t,y0 t) = s4 t8 + s3 t6 + s2 t4 + s1 t2 + s0

Making T = t2 :

                     S(T ) = s4 T 4 + s3 T 3 + s2 T 2 + s1 T + s0

Searched value of t: square root of the biggest real root of S(T )


       F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Distance of closest approach of two separated ellipses


  Theorem
  Given two separated ellipses E1 and E2 the distance of their
  closest approach is given as

                                          d = t0        x 2 + y0
                                                          0
                                                               2


  where t0 is the square root of the biggest positive real root of
  S(T ) = S(t) |T =t2 = (discλ H(λ) |(x0 ,y0 )=(x0 t,y0 t) ) |T =t2 , where
  H(λ) is the characteristic polynomial of the pencil determined
  by them and (x0 , y0 ) is the center of E2 .



         F. Etayo, L. González-Vega, G. R. Quintana      EACA2010
Problem
      Distance of closest approach of two ellipses
     Distance of closest approach of two ellipsoids
                                      Conclusions


Example




                            Let A and B be the ellipses:
                                                                       √
                                                               2  7 2   3     5
                                        A :=          (x, y) ∈ R : x +    xy + y 2 = 10
                                                                  8    4      8
                                                               1 2 3    1    8      109
                                   B :=       (x, y) ∈ R2 :      x − x + y2 − y = −
                                                               4    2   9    9       36




       F. Etayo, L. González-Vega, G. R. Quintana        EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions


Example


 Polynomial whose biggest real root gives the square of the
 instant T = T0 when the ellipses are tangent:

                      466271425
                                                       √                     √
   B
  SA(T ) (T ) =                 + 9019725 3 T 4 + − 627564237     − 16904535 3 T 3
                          16     √                     32         √    2
                     + 39363189 3 + 690647377 T 2 + − 1186083
                            16           256             16         3 − 58434963 T
                                                                          128
                     + 4499761
                         256

                        B
 The two real roots of SA(T ) (T ) are:

                     T0 = 0.5058481537; T1 = 0.07113873679




        F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions


Positions of A and B(t)




            t0 =         T0                                       t1 =   T1


        F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions



Let A1 and A2 be the matrices defining the separated ellipsoids E1
and E2 as X T A1 X = 0 and X T A2 X = 0 where X T = (x, y, z, 1), and
A = (aij ), B = (bij ), i, j = 1..4
Change the reference frame to have E1 centered at the origin and E2 ,
at (x0 , y0 , z0 ) with axis parallel to the coordinate ones:
                                                       P2  Q2  R2
                     E1 =       (x, y, z) ∈ R3 :          + 2 + 2 =1
                                                       a2   b   c

                                         (x − x0 )2   (y − y0 )2   (z − z0 )2
       E2 =       (x, y, z) ∈ R3 :            2
                                                    +      2
                                                                 +            =1
                                            d            f            g2

where
 P = x ux2 + 1 − ux 2 cos (α) + (ux uy (1 − cos (α)) − uz sin (α)) y + . . .
 Q = (ux uy (1 − cos (α)) + uz sin (α)) x + y uy 2 + 1 − uy 2 cos (α) + . . .
 R = (ux uz (1 − cos (α)) − uy sin (α)) x + (uyuz (1 − cos (α)) + ux sin (α)) y + . . .



        F. Etayo, L. González-Vega, G. R. Quintana      EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions




Characteristic polynomial of the pencil λA2 + A1 :

       H(λ) = det(λA2 + A1 ) = h4 λ4 + h3 λ3 + h2 λ2 + h1 λ + h0

Compute the discriminant of H(λ), and introduce the change of
variable (x0 , y0 , z0 ) = (x0 t, y0 t, z0 t). The equation which gives us the
searched value of t, t0 , is S(t) = 0 where:

S(t) = discλ H(λ) |(x0 t,y0 t,z0 t) = s6 t12 +s5 t10 +s4 t8 +s3 t6 +s2 t4 +s1 t2 +s0

Making T = t2 :

           S(T ) = s6 t6 + s5 t5 + s4 T 4 + s3 T 3 + s2 T 2 + s1 T + s0

Searched value of t: square root of the biggest real root of S(T )



        F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Distance of closest approach of two ellipsoids


  Theorem
  Given two separated ellipsoids E1 and E2 the distance of their
  closest approach is given as

                                     d = t0         x 2 + y0 + z0
                                                      0
                                                           2    2


  where t0 is the square root of the biggest positive real root of
  S(T ) = S(t) |T =t2 = (discλ H(λ) |(x0 t,y0 t,z0 t) ) |T =t2 , where H(λ)
  is the characteristic polynomial of the pencil determined by
  them and (x0 , y0 , z0 ) is the center of E2 .



         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions


Example
 Let A (blue) and B (green) be the ellipsoids:




                                                                          1 2 1 2
                                         A :=          (x, y, z) ∈ R3 :     x + y + z2 = 1
                                                                          4    2




                                     1 2        1          1             51
  B :=      (x, y, z) ∈ R3 :           x − 2 x + y2 − 3 y + z2 − 5 z = −
                                     5          4          2              2

         F. Etayo, L. González-Vega, G. R. Quintana       EACA2010
Problem
        Distance of closest approach of two ellipses
       Distance of closest approach of two ellipsoids
                                        Conclusions


Example


 Polynomial whose biggest real root gives the square of the
 instant T = T0 when the ellipsoids are tangent:

 SA(T ) (T ) = 16641 T 2 2725362025 T 4 − 339879840 T 3 + 3362446 T 2 − 11232 T + 9
  B




                        B
 The two real roots of SA(T ) (T ) are:

                        T0 = 0.1142222397; T1 = 0.001153709353




         F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
       Distance of closest approach of two ellipses
      Distance of closest approach of two ellipsoids
                                       Conclusions


Positions of A (blue) and B(t) (green)




            t0 =         T0                                       t1 =   T1


        F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
 Distance of closest approach of two ellipses
Distance of closest approach of two ellipsoids
                                 Conclusions




Ellipses case:
       Basic configuration:
               Compute the eigenvectors of a 2x2 matrix
               Compute the real roots of a 4-degree polynomial
       Other configurations: roots of a 8-degree polynomial
Ellipsoids case:
       Basic configuration:
               Compute the eigenvectors of a 3x3 matrix
               Compute the real roots roots of a 6-degree polynomial
       Other configurations: roots of a 12-degree polynomial




  F. Etayo, L. González-Vega, G. R. Quintana     EACA2010
Problem
    Distance of closest approach of two ellipses
   Distance of closest approach of two ellipsoids
                                    Conclusions




Thank you!




     F. Etayo, L. González-Vega, G. R. Quintana     EACA2010

More Related Content

What's hot

NIPS2009: Sparse Methods for Machine Learning: Theory and Algorithms
NIPS2009: Sparse Methods for Machine Learning: Theory and AlgorithmsNIPS2009: Sparse Methods for Machine Learning: Theory and Algorithms
NIPS2009: Sparse Methods for Machine Learning: Theory and Algorithmszukun
 
Geometry Section 3-4 1112
Geometry Section 3-4 1112Geometry Section 3-4 1112
Geometry Section 3-4 1112Jimbo Lamb
 
Analysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifoldsAnalysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifoldsSpringer
 
Charla Santiago Numerico
Charla Santiago NumericoCharla Santiago Numerico
Charla Santiago Numericoroyarzua
 
Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...
Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...
Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...inventionjournals
 
Nonlinear transport phenomena: models, method of solving and unusual features...
Nonlinear transport phenomena: models, method of solving and unusual features...Nonlinear transport phenomena: models, method of solving and unusual features...
Nonlinear transport phenomena: models, method of solving and unusual features...SSA KPI
 
Soliton Stability of the 2D Nonlinear Schrödinger Equation
Soliton Stability of the 2D Nonlinear Schrödinger EquationSoliton Stability of the 2D Nonlinear Schrödinger Equation
Soliton Stability of the 2D Nonlinear Schrödinger Equationsheilsn
 
Expo Algebra Lineal
Expo Algebra LinealExpo Algebra Lineal
Expo Algebra LinealNoi
 
Some new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equationSome new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equationinventy
 
Neuronal self-organized criticality
Neuronal self-organized criticalityNeuronal self-organized criticality
Neuronal self-organized criticalityOsame Kinouchi
 
Bernheim calculusfinal
Bernheim calculusfinalBernheim calculusfinal
Bernheim calculusfinalrahulrasa
 
Classification of aedes adults mosquitoes in two distinct groups based on fis...
Classification of aedes adults mosquitoes in two distinct groups based on fis...Classification of aedes adults mosquitoes in two distinct groups based on fis...
Classification of aedes adults mosquitoes in two distinct groups based on fis...Alexander Decker
 
SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...
SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...
SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...ijrap
 

What's hot (20)

NTU_paper
NTU_paperNTU_paper
NTU_paper
 
NIPS2009: Sparse Methods for Machine Learning: Theory and Algorithms
NIPS2009: Sparse Methods for Machine Learning: Theory and AlgorithmsNIPS2009: Sparse Methods for Machine Learning: Theory and Algorithms
NIPS2009: Sparse Methods for Machine Learning: Theory and Algorithms
 
03 finding roots
03 finding roots03 finding roots
03 finding roots
 
Geometry Section 3-4 1112
Geometry Section 3-4 1112Geometry Section 3-4 1112
Geometry Section 3-4 1112
 
Kt2418201822
Kt2418201822Kt2418201822
Kt2418201822
 
Rouviere
RouviereRouviere
Rouviere
 
Analysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifoldsAnalysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifolds
 
Charla Santiago Numerico
Charla Santiago NumericoCharla Santiago Numerico
Charla Santiago Numerico
 
Md2521102111
Md2521102111Md2521102111
Md2521102111
 
Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...
Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...
Necessary and Sufficient Conditions for Oscillations of Neutral Delay Differe...
 
Nonlinear transport phenomena: models, method of solving and unusual features...
Nonlinear transport phenomena: models, method of solving and unusual features...Nonlinear transport phenomena: models, method of solving and unusual features...
Nonlinear transport phenomena: models, method of solving and unusual features...
 
Soliton Stability of the 2D Nonlinear Schrödinger Equation
Soliton Stability of the 2D Nonlinear Schrödinger EquationSoliton Stability of the 2D Nonlinear Schrödinger Equation
Soliton Stability of the 2D Nonlinear Schrödinger Equation
 
Expo Algebra Lineal
Expo Algebra LinealExpo Algebra Lineal
Expo Algebra Lineal
 
Some new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equationSome new exact Solutions for the nonlinear schrödinger equation
Some new exact Solutions for the nonlinear schrödinger equation
 
Neuronal self-organized criticality
Neuronal self-organized criticalityNeuronal self-organized criticality
Neuronal self-organized criticality
 
Symmetrical2
Symmetrical2Symmetrical2
Symmetrical2
 
Bernheim calculusfinal
Bernheim calculusfinalBernheim calculusfinal
Bernheim calculusfinal
 
Review of series
Review of seriesReview of series
Review of series
 
Classification of aedes adults mosquitoes in two distinct groups based on fis...
Classification of aedes adults mosquitoes in two distinct groups based on fis...Classification of aedes adults mosquitoes in two distinct groups based on fis...
Classification of aedes adults mosquitoes in two distinct groups based on fis...
 
SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...
SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...
SOLUTIONS OF THE SCHRÖDINGER EQUATION WITH INVERSELY QUADRATIC HELLMANN PLUS ...
 

Viewers also liked

Sales and-marketing
Sales and-marketingSales and-marketing
Sales and-marketingajaymane22
 
Albertini H Bio Collection 2 Pictures
Albertini H Bio Collection 2 PicturesAlbertini H Bio Collection 2 Pictures
Albertini H Bio Collection 2 Picturesktini
 
Mtv studie volkskrant 30 oktober
Mtv studie   volkskrant 30 oktoberMtv studie   volkskrant 30 oktober
Mtv studie volkskrant 30 oktoberBsie
 
Clase ellegadoculturaldegrecia
Clase ellegadoculturaldegreciaClase ellegadoculturaldegrecia
Clase ellegadoculturaldegreciayedra muñoz
 

Viewers also liked (6)

Sales and-marketing
Sales and-marketingSales and-marketing
Sales and-marketing
 
Albertini H Bio Collection 2 Pictures
Albertini H Bio Collection 2 PicturesAlbertini H Bio Collection 2 Pictures
Albertini H Bio Collection 2 Pictures
 
Mtv studie volkskrant 30 oktober
Mtv studie   volkskrant 30 oktoberMtv studie   volkskrant 30 oktober
Mtv studie volkskrant 30 oktober
 
Barcelona
BarcelonaBarcelona
Barcelona
 
MARINA Y GUADALUPE
MARINA Y GUADALUPEMARINA Y GUADALUPE
MARINA Y GUADALUPE
 
Clase ellegadoculturaldegrecia
Clase ellegadoculturaldegreciaClase ellegadoculturaldegrecia
Clase ellegadoculturaldegrecia
 

Similar to EACA2010

MA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docx
MA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docxMA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docx
MA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docxinfantsuk
 
Problems and solutions statistical physics 1
Problems and solutions   statistical physics 1Problems and solutions   statistical physics 1
Problems and solutions statistical physics 1Alberto de Mesquita
 
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...Juri Ranieri
 
amer.math.monthly.124.2.179.pdf
amer.math.monthly.124.2.179.pdfamer.math.monthly.124.2.179.pdf
amer.math.monthly.124.2.179.pdfxohovaf
 
Astronomy Projects For Calculus And Differential Equations
Astronomy Projects For Calculus And Differential EquationsAstronomy Projects For Calculus And Differential Equations
Astronomy Projects For Calculus And Differential EquationsKatie Robinson
 
Mathematical formulation of inverse scattering and korteweg de vries equation
Mathematical formulation of inverse scattering and korteweg de vries equationMathematical formulation of inverse scattering and korteweg de vries equation
Mathematical formulation of inverse scattering and korteweg de vries equationAlexander Decker
 
What are free particles in quantum mechanics
What are free particles in quantum mechanicsWhat are free particles in quantum mechanics
What are free particles in quantum mechanicsbhaskar chatterjee
 
1st LT Coverage
1st LT Coverage1st LT Coverage
1st LT CoverageRio Cañal
 
Magnetic monopoles and group theory.
Magnetic monopoles and group theory.Magnetic monopoles and group theory.
Magnetic monopoles and group theory.Renata Queiroz
 

Similar to EACA2010 (20)

CGTA09
CGTA09CGTA09
CGTA09
 
4 b5lecture62008
4 b5lecture620084 b5lecture62008
4 b5lecture62008
 
Ph 101-1
Ph 101-1Ph 101-1
Ph 101-1
 
MA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docx
MA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docxMA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docx
MA 243 Calculus III Fall 2015 Dr. E. JacobsAssignmentsTh.docx
 
Problems and solutions statistical physics 1
Problems and solutions   statistical physics 1Problems and solutions   statistical physics 1
Problems and solutions statistical physics 1
 
Chapter_4.pptx .
Chapter_4.pptx                          .Chapter_4.pptx                          .
Chapter_4.pptx .
 
Lecture 7
Lecture 7Lecture 7
Lecture 7
 
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...
Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Appl...
 
amer.math.monthly.124.2.179.pdf
amer.math.monthly.124.2.179.pdfamer.math.monthly.124.2.179.pdf
amer.math.monthly.124.2.179.pdf
 
ADG 2008
ADG 2008ADG 2008
ADG 2008
 
dalrymple_slides.ppt
dalrymple_slides.pptdalrymple_slides.ppt
dalrymple_slides.ppt
 
Astronomy Projects For Calculus And Differential Equations
Astronomy Projects For Calculus And Differential EquationsAstronomy Projects For Calculus And Differential Equations
Astronomy Projects For Calculus And Differential Equations
 
Mathematical formulation of inverse scattering and korteweg de vries equation
Mathematical formulation of inverse scattering and korteweg de vries equationMathematical formulation of inverse scattering and korteweg de vries equation
Mathematical formulation of inverse scattering and korteweg de vries equation
 
What are free particles in quantum mechanics
What are free particles in quantum mechanicsWhat are free particles in quantum mechanics
What are free particles in quantum mechanics
 
Chem 1st LT
Chem 1st LTChem 1st LT
Chem 1st LT
 
1st LT Coverage
1st LT Coverage1st LT Coverage
1st LT Coverage
 
UNIT 4_BCH-106.pptx
UNIT 4_BCH-106.pptxUNIT 4_BCH-106.pptx
UNIT 4_BCH-106.pptx
 
Quantum chaos of generic systems - Marko Robnik
Quantum chaos of generic systems - Marko RobnikQuantum chaos of generic systems - Marko Robnik
Quantum chaos of generic systems - Marko Robnik
 
Analisis unidad 3
Analisis unidad 3Analisis unidad 3
Analisis unidad 3
 
Magnetic monopoles and group theory.
Magnetic monopoles and group theory.Magnetic monopoles and group theory.
Magnetic monopoles and group theory.
 

More from Gema R. Quintana

Pechakucha Congreso DIMA 2018
Pechakucha Congreso DIMA 2018Pechakucha Congreso DIMA 2018
Pechakucha Congreso DIMA 2018Gema R. Quintana
 
Motivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los AdolescentesMotivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los AdolescentesGema R. Quintana
 
Motivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los AdolescentesMotivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los AdolescentesGema R. Quintana
 
Intersección medicina y matemáticas
Intersección medicina y matemáticasIntersección medicina y matemáticas
Intersección medicina y matemáticasGema R. Quintana
 
Introduction to Lie Groups
Introduction to Lie GroupsIntroduction to Lie Groups
Introduction to Lie GroupsGema R. Quintana
 
Presentation of my Master's Thesis
Presentation of my Master's ThesisPresentation of my Master's Thesis
Presentation of my Master's ThesisGema R. Quintana
 
Master's Thesis: Closed formulae for distance functions involving ellipses.
Master's Thesis: Closed formulae for distance functions involving ellipses.Master's Thesis: Closed formulae for distance functions involving ellipses.
Master's Thesis: Closed formulae for distance functions involving ellipses.Gema R. Quintana
 
VXC: Computer Vision Presentation
VXC: Computer Vision PresentationVXC: Computer Vision Presentation
VXC: Computer Vision PresentationGema R. Quintana
 

More from Gema R. Quintana (14)

Pechakucha Congreso DIMA 2018
Pechakucha Congreso DIMA 2018Pechakucha Congreso DIMA 2018
Pechakucha Congreso DIMA 2018
 
Motivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los AdolescentesMotivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los Adolescentes
 
Motivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los AdolescentesMotivos para el uso de Instagram en los Adolescentes
Motivos para el uso de Instagram en los Adolescentes
 
Creativity is...
Creativity is...Creativity is...
Creativity is...
 
Intersección medicina y matemáticas
Intersección medicina y matemáticasIntersección medicina y matemáticas
Intersección medicina y matemáticas
 
Introduction to Lie Groups
Introduction to Lie GroupsIntroduction to Lie Groups
Introduction to Lie Groups
 
Presentation of my Master's Thesis
Presentation of my Master's ThesisPresentation of my Master's Thesis
Presentation of my Master's Thesis
 
Master's Thesis: Closed formulae for distance functions involving ellipses.
Master's Thesis: Closed formulae for distance functions involving ellipses.Master's Thesis: Closed formulae for distance functions involving ellipses.
Master's Thesis: Closed formulae for distance functions involving ellipses.
 
VXC: Computer Vision Presentation
VXC: Computer Vision PresentationVXC: Computer Vision Presentation
VXC: Computer Vision Presentation
 
VXC: Computer Vision
VXC: Computer VisionVXC: Computer Vision
VXC: Computer Vision
 
Real Surfaces
Real SurfacesReal Surfaces
Real Surfaces
 
Real Surfaces
Real SurfacesReal Surfaces
Real Surfaces
 
CVC Seminar
CVC SeminarCVC Seminar
CVC Seminar
 
CIEM 07
CIEM 07CIEM 07
CIEM 07
 

Recently uploaded

ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxAreebaZafar22
 
Z Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphZ Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphThiyagu K
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactdawncurless
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introductionMaksud Ahmed
 
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...KokoStevan
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityGeoBlogs
 
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in DelhiRussian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhikauryashika82
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfagholdier
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeThiyagu K
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxDenish Jangid
 
fourth grading exam for kindergarten in writing
fourth grading exam for kindergarten in writingfourth grading exam for kindergarten in writing
fourth grading exam for kindergarten in writingTeacherCyreneCayanan
 
PROCESS RECORDING FORMAT.docx
PROCESS      RECORDING        FORMAT.docxPROCESS      RECORDING        FORMAT.docx
PROCESS RECORDING FORMAT.docxPoojaSen20
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxiammrhaywood
 
Application orientated numerical on hev.ppt
Application orientated numerical on hev.pptApplication orientated numerical on hev.ppt
Application orientated numerical on hev.pptRamjanShidvankar
 
Gardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterGardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterMateoGardella
 
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdfWeb & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdfJayanti Pande
 
Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..Disha Kariya
 

Recently uploaded (20)

ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptx
 
Z Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphZ Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot Graph
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introduction
 
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptxINDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
 
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
 
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in DelhiRussian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
 
Advance Mobile Application Development class 07
Advance Mobile Application Development class 07Advance Mobile Application Development class 07
Advance Mobile Application Development class 07
 
fourth grading exam for kindergarten in writing
fourth grading exam for kindergarten in writingfourth grading exam for kindergarten in writing
fourth grading exam for kindergarten in writing
 
PROCESS RECORDING FORMAT.docx
PROCESS      RECORDING        FORMAT.docxPROCESS      RECORDING        FORMAT.docx
PROCESS RECORDING FORMAT.docx
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
 
Application orientated numerical on hev.ppt
Application orientated numerical on hev.pptApplication orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
 
Gardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterGardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch Letter
 
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdfWeb & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
 
Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..
 

EACA2010

  • 1. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Computing the distance of closest approach between ellipses and ellipsoids F. Etayo, L. González-Vega, G. R. Quintana Departamento de MATemáticas, EStadística y COmputación University of Cantabria, Spain XII Encuentro de Álgebra Computacional y Aplicaciones, Santiago de Compostela, 19-21 de julio de 2010 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 2. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Contents 1 Problem 2 Distance of closest approach of two ellipses 3 Distance of closest approach of two ellipsoids 4 Conclusions F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 3. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Introduction The distance of closest approach of two arbitrary separated ellipses (resp. ellipsoids) is the distance among their centers when they are externally tangent, after moving them through the line joining their centers. That distance appears when we study the problem of determining the distance of closest approach of hard particles which is a key topic in some physical questions like modeling and simulating systems of anisometric particles, such as liquid crystals, or in the case of interference analysis of molecules. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 4. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Introduction Distance of closest approach of two ellipses. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 5. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Previous work A description of a method for solving the problem in the case of two arbitrary hard ellipses (resp. ellipsoids) can be found in X. Z HENG , P. PALFFY-M UHORAY, Distance of closest approach of two arbitrary hard ellipses in two dimensions, Phys. Rev., E 75, 061709, 2007. X. Z HENG , W. I GLESIAS , P. PALFFY-M UHORAY, Distance of closest approach of two arbitrary hard ellipsoids, Phys. Rev. E, 79, 057702, 2009. An analytic expression for that distance is given as a function of their orientation relative to the line joining their centers. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 6. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Previous work (Zheng,Palffy-Muhoray) Ellipses case: 1 Two ellipses initially distant are given. 2 One ellipse is translated toward the other along the line joining their centers until they are externally tangent. 3 PROBLEM: to find the distance d between the centers at that time. 4 Transformation of the two tangent ellipses into a circle and an ellipse. 5 Determination of the distance d of closest approach of the circle and the ellipse. 6 Determination of the distance d of closest approach of the initial ellipses by inverse transformation. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 7. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Previous work (Zheng,Palffy-Muhoray) Ellipses case: 1 Two ellipses initially distant are given. 2 One ellipse is translated toward the other along the line joining their centers until they are externally tangent. 3 PROBLEM: to find the distance d between the centers at that time. 4 Transformation of the two tangent ellipses into a circle and an ellipse. ⇒ Anisotropic scaling 5 Determination of the distance d of closest approach of the circle and the ellipse. 6 Determination of the distance d of closest approach of the initial ellipses by inverse transformation. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 8. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Previous work (Zheng,Iglesias,Palffy-Muhoray) Ellipsoids case: 1 Two ellipsoids initially distant are given. 2 Plane containing the line joining the centers of the two ellipsoids. 3 Equations of the ellipses formed by the intersection of this plane and the ellipsoids. 4 Determining the distance of closest approach of the ellipses 5 Rotating the plane until the distance of closest approach of the ellipses is a maximum 6 The distance of closest approach of the ellipsoids is this maximum distance F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 9. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Previous work To deal with anisotropic scaling and the inverse transformation involves the calculus of the eigenvectors and eigenvalues of the matrix of the transformation. Our goal is to find when that computation is not required and if it is, to simplify it. The way in which we do that extends in a natural way the ellipsoids case. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 10. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Our approach We use the results shown in: F. E TAYO, L. G ONZ·LEZ -V EGA , N. DEL RÌ O, A new approach to characterizing the relative position of two ellipses depending on one parameter, Computed Aided Geometric Desing 23, 324-350, 2006. W. WANG , R. K RASAUSKAS, Interference analysis of conics and quadrics, Contemporary Math. 334, 25-36,2003. W. WANG , J. WANG , M. S. K IM, An algebraic condition for the separation of two ellipsoids, Computer Aided Geometric Desing 18, 531-539, 2001. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 11. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Our approach Following their notation we define Definition Let A and B be two ellipses (resp. ellipsoids) given by the equations X T AX = 0 and X T BX = 0 respectively, the degree three (resp. four) polynomial f (λ) = det(λA + B) is called the characteristic polynomial of the pencil λA + B Two ellipses (or ellipsoids) are separated if and only if their characteristic polynomial has two distinct positive roots. The ellipses (or ellipsoids) touch each other externally if and only if the characteristic equation has a positive double root. F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 12. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Our approach We use the previous characterization in order to obtain the solution of the problem. We give a closed formula for the polynomial S(t) (depending polynomially on the ellipse parameters) whose biggest real root provides the distance of closest approach: Ellipses case: d = t0 x 2 + y0 0 2 Ellipsoids case: d = t0 x 2 + y0 + z0 0 2 2 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 13. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions We consider the two coplanar ellipses given by the equations: E1 = (x, y) ∈ R2 : a22 x2 + a33 y 2 + 2a23 xy + 2a31 x + 2a32 y + a11 = 0 E2 = (x, y) ∈ R2 : b22 x2 + b33 y 2 + 2b23 xy + 2b31 x + 2b32 y + b11 = 0 We change the reference frame in order to have E1 centered at the origin and E2 centered at (x0 , y0 ) with axis parallel to the coordinate ones: (x cos (α) + y sin (α))2 (x sin (α) − y cos (α))2 E1 = (x, y) ∈ R2 : + =1 a b (x − x0 )2 (y − y0 )2 E2 = (x, y) ∈ R2 : + =1 c d F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 14. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Let A1 and A2 be the matrices associated to E1 and E2 . Characteristic polynomial of the pencil λA2 + A1 : H(λ) = det(λA2 + A1 ) = h3 λ3 + h2 λ2 + h1 λ + h0 Compute the discriminant of H(λ), and introduce the change of variable (x0 , y0 ) = (x0 t, y0 t). The equation which gives us the searched value of t, t0 , is S(t) = 0 where: S(t) = discλ H(λ) |(x0 ,y0 )=(x0 t,y0 t) = s4 t8 + s3 t6 + s2 t4 + s1 t2 + s0 Making T = t2 : S(T ) = s4 T 4 + s3 T 3 + s2 T 2 + s1 T + s0 Searched value of t: square root of the biggest real root of S(T ) F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 15. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Distance of closest approach of two separated ellipses Theorem Given two separated ellipses E1 and E2 the distance of their closest approach is given as d = t0 x 2 + y0 0 2 where t0 is the square root of the biggest positive real root of S(T ) = S(t) |T =t2 = (discλ H(λ) |(x0 ,y0 )=(x0 t,y0 t) ) |T =t2 , where H(λ) is the characteristic polynomial of the pencil determined by them and (x0 , y0 ) is the center of E2 . F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 16. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Example Let A and B be the ellipses: √ 2 7 2 3 5 A := (x, y) ∈ R : x + xy + y 2 = 10 8 4 8 1 2 3 1 8 109 B := (x, y) ∈ R2 : x − x + y2 − y = − 4 2 9 9 36 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 17. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Example Polynomial whose biggest real root gives the square of the instant T = T0 when the ellipses are tangent: 466271425 √ √ B SA(T ) (T ) = + 9019725 3 T 4 + − 627564237 − 16904535 3 T 3 16 √ 32 √ 2 + 39363189 3 + 690647377 T 2 + − 1186083 16 256 16 3 − 58434963 T 128 + 4499761 256 B The two real roots of SA(T ) (T ) are: T0 = 0.5058481537; T1 = 0.07113873679 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 18. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Positions of A and B(t) t0 = T0 t1 = T1 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 19. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Let A1 and A2 be the matrices defining the separated ellipsoids E1 and E2 as X T A1 X = 0 and X T A2 X = 0 where X T = (x, y, z, 1), and A = (aij ), B = (bij ), i, j = 1..4 Change the reference frame to have E1 centered at the origin and E2 , at (x0 , y0 , z0 ) with axis parallel to the coordinate ones: P2 Q2 R2 E1 = (x, y, z) ∈ R3 : + 2 + 2 =1 a2 b c (x − x0 )2 (y − y0 )2 (z − z0 )2 E2 = (x, y, z) ∈ R3 : 2 + 2 + =1 d f g2 where P = x ux2 + 1 − ux 2 cos (α) + (ux uy (1 − cos (α)) − uz sin (α)) y + . . . Q = (ux uy (1 − cos (α)) + uz sin (α)) x + y uy 2 + 1 − uy 2 cos (α) + . . . R = (ux uz (1 − cos (α)) − uy sin (α)) x + (uyuz (1 − cos (α)) + ux sin (α)) y + . . . F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 20. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Characteristic polynomial of the pencil λA2 + A1 : H(λ) = det(λA2 + A1 ) = h4 λ4 + h3 λ3 + h2 λ2 + h1 λ + h0 Compute the discriminant of H(λ), and introduce the change of variable (x0 , y0 , z0 ) = (x0 t, y0 t, z0 t). The equation which gives us the searched value of t, t0 , is S(t) = 0 where: S(t) = discλ H(λ) |(x0 t,y0 t,z0 t) = s6 t12 +s5 t10 +s4 t8 +s3 t6 +s2 t4 +s1 t2 +s0 Making T = t2 : S(T ) = s6 t6 + s5 t5 + s4 T 4 + s3 T 3 + s2 T 2 + s1 T + s0 Searched value of t: square root of the biggest real root of S(T ) F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 21. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Distance of closest approach of two ellipsoids Theorem Given two separated ellipsoids E1 and E2 the distance of their closest approach is given as d = t0 x 2 + y0 + z0 0 2 2 where t0 is the square root of the biggest positive real root of S(T ) = S(t) |T =t2 = (discλ H(λ) |(x0 t,y0 t,z0 t) ) |T =t2 , where H(λ) is the characteristic polynomial of the pencil determined by them and (x0 , y0 , z0 ) is the center of E2 . F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 22. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Example Let A (blue) and B (green) be the ellipsoids: 1 2 1 2 A := (x, y, z) ∈ R3 : x + y + z2 = 1 4 2 1 2 1 1 51 B := (x, y, z) ∈ R3 : x − 2 x + y2 − 3 y + z2 − 5 z = − 5 4 2 2 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 23. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Example Polynomial whose biggest real root gives the square of the instant T = T0 when the ellipsoids are tangent: SA(T ) (T ) = 16641 T 2 2725362025 T 4 − 339879840 T 3 + 3362446 T 2 − 11232 T + 9 B B The two real roots of SA(T ) (T ) are: T0 = 0.1142222397; T1 = 0.001153709353 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 24. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Positions of A (blue) and B(t) (green) t0 = T0 t1 = T1 F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 25. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Ellipses case: Basic configuration: Compute the eigenvectors of a 2x2 matrix Compute the real roots of a 4-degree polynomial Other configurations: roots of a 8-degree polynomial Ellipsoids case: Basic configuration: Compute the eigenvectors of a 3x3 matrix Compute the real roots roots of a 6-degree polynomial Other configurations: roots of a 12-degree polynomial F. Etayo, L. González-Vega, G. R. Quintana EACA2010
  • 26. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Thank you! F. Etayo, L. González-Vega, G. R. Quintana EACA2010