ABSTRACT
Two new linear contact detection algorithms are developed. The first algorithm is suitable for particles of near spherical shape and near constant size. The second algorithm is suitable for particles of near spherical shape greatly differing in size. Both algorithms are insensitive to packing density in terms of CPU and random access memory (RAM) requirements. The data structure is very simple and RAM requirements are small enabling theoretically billions of particles to be addressed on a desktop machine.