Download Spatial Sorting Collision detection algorithm

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Relational approach to quantum physics wikipedia , lookup

Double-slit experiment wikipedia , lookup

Standard Model wikipedia , lookup

ALICE experiment wikipedia , lookup

Electron scattering wikipedia , lookup

Weakly-interacting massive particles wikipedia , lookup

ATLAS experiment wikipedia , lookup

Identical particles wikipedia , lookup

Compact Muon Solenoid wikipedia , lookup

Elementary particle wikipedia , lookup

Spatial analysis wikipedia , lookup

Transcript
Spatial Sorting Collision detection
algorithm
A.
Goals:
Develop an efficient algorithm
to detect collision between
particles, and apply it to several
problems such as two fluid
modeling and platelet
coagulation.
B. Brief Description:
Sorting particles before
detecting collision and finding
the neighbors for each particle,
improves the computational
cost, allowing to use higher
number of particles in
simulations.
C. Heights of Achievements this
semester (using bullets):
• Basic spatial sorting algorithm
• Improvement spatial sorting
algorithm
• Addition of spatial sorting
algorithm in platelet
coagulation simulation
Spatial Sorting Collision detection
algorithm
+