A fast approach for contact detection of polydisperse sphere particle systems simulation

Collision detection is a basic computational problem arising in computer simulations of systems consisting of polydisperse particles. The Linked Cell List method is unable to efficiently deal with particles of greatly varying sizes. In order to improve efficiency of particle collision detection at high density. We present nearest neighbor list algorithm to collision detection among particles of greatly varying sizes. We achieved several times speed-up compared to Linked Cell List method. For larger size ratios, even better speed-up is expected.