SlideShare a Scribd company logo
1 of 25
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

                   L. Gonzalez-Vega, G. R. Quintana

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




 2009 SIAM/ACM Joint Conference on Geometric and
       Physical Modeling, October 5-8, 2009

            L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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




                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.



                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.

                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.

                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.

                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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

                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.




                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.




                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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.


                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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




                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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




                L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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 )


                L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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 .



                  L. Gonzalez-Vega, G. R. Quintana       GDSPM09
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




                L. Gonzalez-Vega, G. R. Quintana         GDSPM09
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




                 L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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


                 L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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 + . . .



                 L. Gonzalez-Vega, G. R. Quintana       GDSPM09
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 )



                 L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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 .



                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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:




                                                                         3       1       2       1   2      2
                                                  A :=   (x, y, z) ∈ R       :       x +             y +z       =1
                                                                                 4               2

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




                 L. Gonzalez-Vega, G. R. Quintana        GDSPM09
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




                  L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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


                 L. Gonzalez-Vega, G. R. Quintana      GDSPM09
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




           L. Gonzalez-Vega, G. R. Quintana      GDSPM09
Problem
    Distance of closest approach of two ellipses
   Distance of closest approach of two ellipsoids
                                    Conclusions




Thank you!




              L. Gonzalez-Vega, G. R. Quintana      GDSPM09

More Related Content

What's hot

M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesM. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesSEENET-MTP
 
Ck31369376
Ck31369376Ck31369376
Ck31369376IJMER
 
11.solution of a singular class of boundary value problems by variation itera...
11.solution of a singular class of boundary value problems by variation itera...11.solution of a singular class of boundary value problems by variation itera...
11.solution of a singular class of boundary value problems by variation itera...Alexander Decker
 
Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...
Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...
Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...arj_online
 
Solution of a singular class of boundary value problems by variation iteratio...
Solution of a singular class of boundary value problems by variation iteratio...Solution of a singular class of boundary value problems by variation iteratio...
Solution of a singular class of boundary value problems by variation iteratio...Alexander Decker
 
Physical Chemistry Assignment Help
Physical Chemistry Assignment HelpPhysical Chemistry Assignment Help
Physical Chemistry Assignment HelpEdu Assignment Help
 
Poster Partial And Complete Observables
Poster Partial And Complete ObservablesPoster Partial And Complete Observables
Poster Partial And Complete Observablesguest9fa195
 
[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)
[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)
[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)Dabe Milli
 
tensor-decomposition
tensor-decompositiontensor-decomposition
tensor-decompositionKenta Oono
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 
Predictve data mining
Predictve data miningPredictve data mining
Predictve data miningMintu246
 
Neil Lambert - From D-branes to M-branes
Neil Lambert - From D-branes to M-branesNeil Lambert - From D-branes to M-branes
Neil Lambert - From D-branes to M-branesSEENET-MTP
 
Application of laplace transform
Application of laplace transformApplication of laplace transform
Application of laplace transformAshishbaruah4
 
Tensor Decomposition and its Applications
Tensor Decomposition and its ApplicationsTensor Decomposition and its Applications
Tensor Decomposition and its ApplicationsKeisuke OTAKI
 

What's hot (20)

Md2521102111
Md2521102111Md2521102111
Md2521102111
 
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesM. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
 
Ck31369376
Ck31369376Ck31369376
Ck31369376
 
ZZZZTalk
ZZZZTalkZZZZTalk
ZZZZTalk
 
11.solution of a singular class of boundary value problems by variation itera...
11.solution of a singular class of boundary value problems by variation itera...11.solution of a singular class of boundary value problems by variation itera...
11.solution of a singular class of boundary value problems by variation itera...
 
Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...
Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...
Chebyshev Polynomial Based Numerical Inverse Laplace Transform Solutions of L...
 
Solution of a singular class of boundary value problems by variation iteratio...
Solution of a singular class of boundary value problems by variation iteratio...Solution of a singular class of boundary value problems by variation iteratio...
Solution of a singular class of boundary value problems by variation iteratio...
 
NTU_paper
NTU_paperNTU_paper
NTU_paper
 
Physical Chemistry Assignment Help
Physical Chemistry Assignment HelpPhysical Chemistry Assignment Help
Physical Chemistry Assignment Help
 
Poster Partial And Complete Observables
Poster Partial And Complete ObservablesPoster Partial And Complete Observables
Poster Partial And Complete Observables
 
[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)
[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)
[Vvedensky d.] group_theory,_problems_and_solution(book_fi.org)
 
Review of series
Review of seriesReview of series
Review of series
 
Iwsmbvs
IwsmbvsIwsmbvs
Iwsmbvs
 
tensor-decomposition
tensor-decompositiontensor-decomposition
tensor-decomposition
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
Predictve data mining
Predictve data miningPredictve data mining
Predictve data mining
 
Neil Lambert - From D-branes to M-branes
Neil Lambert - From D-branes to M-branesNeil Lambert - From D-branes to M-branes
Neil Lambert - From D-branes to M-branes
 
Ma2002 1.23 rm
Ma2002 1.23 rmMa2002 1.23 rm
Ma2002 1.23 rm
 
Application of laplace transform
Application of laplace transformApplication of laplace transform
Application of laplace transform
 
Tensor Decomposition and its Applications
Tensor Decomposition and its ApplicationsTensor Decomposition and its Applications
Tensor Decomposition and its Applications
 

Viewers also liked

Cmpnt of gdp
Cmpnt of gdpCmpnt of gdp
Cmpnt of gdpRaj Anwar
 
معايير المحاسبة الدولية
معايير المحاسبة الدوليةمعايير المحاسبة الدولية
معايير المحاسبة الدوليةريهان سالم
 
Manajemen kelas
Manajemen kelasManajemen kelas
Manajemen kelasAnie01
 
46 potongan tagihan-murabahah
46 potongan tagihan-murabahah46 potongan tagihan-murabahah
46 potongan tagihan-murabahahSiLvi FitrissaLam
 
Resultados de web 2.0
Resultados de web 2.0Resultados de web 2.0
Resultados de web 2.0holger
 
Fifteen Minutes Clothing
Fifteen Minutes ClothingFifteen Minutes Clothing
Fifteen Minutes Clothingricarrrdo
 
Tache complexe
Tache complexeTache complexe
Tache complexevguili
 
Measurement & Its Daily Use
Measurement & Its Daily UseMeasurement & Its Daily Use
Measurement & Its Daily UseRShaver
 
ข้อสอบ ฟิสิกส์
ข้อสอบ ฟิสิกส์ข้อสอบ ฟิสิกส์
ข้อสอบ ฟิสิกส์patamaporn605
 
¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...
¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...
¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...Azucena Agüero Torres
 
Microsoft Solutions Framework
Microsoft Solutions FrameworkMicrosoft Solutions Framework
Microsoft Solutions FrameworkTaty Millan
 
Good housekeeping and marieclaire
Good housekeeping and marieclaireGood housekeeping and marieclaire
Good housekeeping and marieclairefinneyh
 
A proposal for an econometric analysis of switching costs in the software ind...
A proposal for an econometric analysis of switching costs in the software ind...A proposal for an econometric analysis of switching costs in the software ind...
A proposal for an econometric analysis of switching costs in the software ind...haramaya university
 

Viewers also liked (20)

42 syariah charge-card
42 syariah charge-card42 syariah charge-card
42 syariah charge-card
 
Cmpnt of gdp
Cmpnt of gdpCmpnt of gdp
Cmpnt of gdp
 
Creativity8
Creativity8Creativity8
Creativity8
 
معايير المحاسبة الدولية
معايير المحاسبة الدوليةمعايير المحاسبة الدولية
معايير المحاسبة الدولية
 
Manajemen kelas
Manajemen kelasManajemen kelas
Manajemen kelas
 
46 potongan tagihan-murabahah
46 potongan tagihan-murabahah46 potongan tagihan-murabahah
46 potongan tagihan-murabahah
 
Alma montemayor
Alma montemayorAlma montemayor
Alma montemayor
 
Resultados de web 2.0
Resultados de web 2.0Resultados de web 2.0
Resultados de web 2.0
 
Fifteen Minutes Clothing
Fifteen Minutes ClothingFifteen Minutes Clothing
Fifteen Minutes Clothing
 
Tache complexe
Tache complexeTache complexe
Tache complexe
 
Carpetas
CarpetasCarpetas
Carpetas
 
Ggg
GggGgg
Ggg
 
Measurement & Its Daily Use
Measurement & Its Daily UseMeasurement & Its Daily Use
Measurement & Its Daily Use
 
C R M
C R MC R M
C R M
 
Ch01
Ch01Ch01
Ch01
 
ข้อสอบ ฟิสิกส์
ข้อสอบ ฟิสิกส์ข้อสอบ ฟิสิกส์
ข้อสอบ ฟิสิกส์
 
¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...
¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...
¿Qué cosas importantes crees que deberías aprender y no estás aprendiendo par...
 
Microsoft Solutions Framework
Microsoft Solutions FrameworkMicrosoft Solutions Framework
Microsoft Solutions Framework
 
Good housekeeping and marieclaire
Good housekeeping and marieclaireGood housekeeping and marieclaire
Good housekeeping and marieclaire
 
A proposal for an econometric analysis of switching costs in the software ind...
A proposal for an econometric analysis of switching costs in the software ind...A proposal for an econometric analysis of switching costs in the software ind...
A proposal for an econometric analysis of switching costs in the software ind...
 

Similar to Distance of Closest Approach Between Ellipses and Ellipsoids

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
 
Bernard schutz gr
Bernard schutz grBernard schutz gr
Bernard schutz grjcklp1
 
Two_variations_on_the_periscope_theorem.pdf
Two_variations_on_the_periscope_theorem.pdfTwo_variations_on_the_periscope_theorem.pdf
Two_variations_on_the_periscope_theorem.pdfIbrahimHabib26
 
Ppp1 Rubber Elasticity
Ppp1 Rubber ElasticityPpp1 Rubber Elasticity
Ppp1 Rubber Elasticityguest824336
 
Schutz 2
Schutz 2Schutz 2
Schutz 2jcklp1
 
1st LT Coverage
1st LT Coverage1st LT Coverage
1st LT CoverageRio Cañal
 
Advchemchapt7 101015115641-phpapp02
Advchemchapt7 101015115641-phpapp02Advchemchapt7 101015115641-phpapp02
Advchemchapt7 101015115641-phpapp02Cleophas Rwemera
 
Geometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pdeGeometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pdeSpringer
 
Quantum physics
Quantum physicsQuantum physics
Quantum physicsKumar
 

Similar to Distance of Closest Approach Between Ellipses and Ellipsoids (20)

CGTA09
CGTA09CGTA09
CGTA09
 
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
 
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...
 
dalrymple_slides.ppt
dalrymple_slides.pptdalrymple_slides.ppt
dalrymple_slides.ppt
 
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
 
Lecture 7
Lecture 7Lecture 7
Lecture 7
 
Bernard schutz gr
Bernard schutz grBernard schutz gr
Bernard schutz gr
 
Two_variations_on_the_periscope_theorem.pdf
Two_variations_on_the_periscope_theorem.pdfTwo_variations_on_the_periscope_theorem.pdf
Two_variations_on_the_periscope_theorem.pdf
 
Cs345 cl
Cs345 clCs345 cl
Cs345 cl
 
Ppp1 Rubber Elasticity
Ppp1 Rubber ElasticityPpp1 Rubber Elasticity
Ppp1 Rubber Elasticity
 
Mie theory of light scattering
Mie theory of light scatteringMie theory of light scattering
Mie theory of light scattering
 
Physics Assignment Help
Physics Assignment Help Physics Assignment Help
Physics Assignment Help
 
Schutz 2
Schutz 2Schutz 2
Schutz 2
 
Chem 1st LT
Chem 1st LTChem 1st LT
Chem 1st LT
 
1st LT Coverage
1st LT Coverage1st LT Coverage
1st LT Coverage
 
Advchemchapt7 101015115641-phpapp02
Advchemchapt7 101015115641-phpapp02Advchemchapt7 101015115641-phpapp02
Advchemchapt7 101015115641-phpapp02
 
Geometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pdeGeometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pde
 
4 b5lecture62008
4 b5lecture620084 b5lecture62008
4 b5lecture62008
 
Quantum physics
Quantum physicsQuantum physics
Quantum physics
 

More from Gema R. Quintana

More from Gema R. Quintana (17)

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
 
EACA08
EACA08EACA08
EACA08
 
CVC Seminar
CVC SeminarCVC Seminar
CVC Seminar
 
CIEM 07
CIEM 07CIEM 07
CIEM 07
 
ADG 2008
ADG 2008ADG 2008
ADG 2008
 
ADG08
ADG08ADG08
ADG08
 

Recently uploaded

Hybridoma Technology ( Production , Purification , and Application )
Hybridoma Technology  ( Production , Purification , and Application  ) Hybridoma Technology  ( Production , Purification , and Application  )
Hybridoma Technology ( Production , Purification , and Application ) Sakshi Ghasle
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)eniolaolutunde
 
Science 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its CharacteristicsScience 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its CharacteristicsKarinaGenton
 
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationInteractive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationnomboosow
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13Steve Thomason
 
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Krashi Coaching
 
How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17Celine George
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Celine George
 
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentAlper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentInMediaRes1
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxGaneshChakor2
 
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...M56BOOKSTORE PRODUCT/SERVICE
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionSafetyChain Software
 
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfConcept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfUmakantAnnand
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxiammrhaywood
 
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsanshu789521
 
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPTECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPTiammrhaywood
 

Recently uploaded (20)

Hybridoma Technology ( Production , Purification , and Application )
Hybridoma Technology  ( Production , Purification , and Application  ) Hybridoma Technology  ( Production , Purification , and Application  )
Hybridoma Technology ( Production , Purification , and Application )
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
 
Science 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its CharacteristicsScience 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its Characteristics
 
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationInteractive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communication
 
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
 
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini  Delhi NCR9953330565 Low Rate Call Girls In Rohini  Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
 
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdfTataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
 
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
 
How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
 
Staff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSDStaff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSD
 
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentAlper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
 
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
 
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfConcept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
 
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
 
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPTECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
 

Distance of Closest Approach Between Ellipses and Ellipsoids

  • 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 L. Gonzalez-Vega, G. R. Quintana Departamento de MATemáticas, EStadística y COmputación University of Cantabria, Spain 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling, October 5-8, 2009 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 4. 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 5. 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 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. ⇒ 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 7. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 8. 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 9. 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 10. 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. L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 11. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 12. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 13. 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 ) L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 14. 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 . L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 15. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 16. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 17. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 18. 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 + . . . L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 19. 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 ) L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 20. 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 . L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 21. 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: 3 1 2 1 2 2 A := (x, y, z) ∈ R : x + y +z =1 4 2 3 1 2 1 2 1 2 51 B := (x, y, z) ∈ R : x − 2x + y − 3y + z − 5z = − 5 4 2 2 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 22. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 23. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 24. 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 L. Gonzalez-Vega, G. R. Quintana GDSPM09
  • 25. Problem Distance of closest approach of two ellipses Distance of closest approach of two ellipsoids Conclusions Thank you! L. Gonzalez-Vega, G. R. Quintana GDSPM09