Method for unique collisions between 2 subdivided ellipses

Michel_vdg
Messages
107
Reaction score
1
Hello,

I would like find a way to figure out how many unique collision there are between 2 equally subdivided ellipsoids (velocity=1).

When you have 2 ellipsoids and you let them collide than you have an infinite amount of possible outcomes.

The goal is to reduce this infinite number to a manageable list of for example unique 32 collisions by:
  1. Subdividing the ellipsoids, so instead of having an infinite number of points on these ellipsoids where they can hit, they are subdivided into 3 zones (I-II-III per quarter).
  2. Reduce the possible rotation angles into steps of 15°
  3. Using symmetry, to cancel out the collisions that are the same when A hits B vs. B hits A, and the outcome of a collision on the left side is symmetric to one on the right, or back and front etc.
(Note, the use of 3 Zones and 15° Angles is arbitrary, i guess once a method is found these could be easily changed into whatever.)

--

Attached is an overview where the Ellipse A is Set and B comes flying in (see pic.), and where:
  • B is shifted a couple of steps along the vertical-axis (right-top).
  • B is rotated in relation to A in steps of 15° (left-bottom)
  • B is rotated in relation to A in steps of 15° and B itself is rotated 15° (right-bottom)
  • B is shifted a couple of steps along the horizontal-axis and B itself is rotated 105°(left-top).
--

I don't know if such a method already exists or if this is perhaps something that should be solved with a Monte Carlo method or ... all suggestions are welcome to tackle this issue.

Kind regards,

m.

getImageAttachment?filename=Collision_Ellipsoids.png
 
Mathematics news on Phys.org
... seems like I better figure this out 'manually' ...

getImageAttachment?filename=manually.png
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top