Collision detection for N-body Kepler systems
P. M. Visser

TL;DR
This paper presents an efficient algorithm for detecting collisions in N-body Kepler systems, enabling large-scale simulations of astronomical bodies with improved computational performance.
Contribution
The authors develop an analytic collision detection algorithm based on orbital period ratios, allowing faster simulations of large N-body systems with collision events.
Findings
The collision-time problem reduces to a grid point closest to the origin between two parallel lines.
The algorithm can outperform tree codes for systems with N<10^8.
High efficiency enables extensive statistical studies of orbital systems.
Abstract
In a Keplerian system, a large number of bodies orbit a central mass. Accretion disks, protoplanetary disks, asteroid belts, and planetary rings are examples. Simulations of these systems require algorithms that are computationally efficient. The inclusion of collisions in the simulations is challenging but important. We intend to calculate the time of collision of two astronomical bodies in intersecting Kepler orbits as a function of the orbital elements. The aim is to use the solution in an analytic propagator (-body simulation) that jumps from one collision event to the next. We outline an algorithm that maintains a list of possible collision pairs ordered chronologically. At each step (the soonest event on the list), only the particles created in the collision can cause new collision possibilities. We estimate the collision rate, the length of the list, and the average change in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
