Analysis of Disjoint Two-Dimensional Particle Assemblies

Abstract

This paper describes a new discrete algorithm for analyzing the behavior of two-dimensional (2D) assemblies of disjoint particles. The algorithm treats each particle as a 2D polygon, and generates contact normal and shear forces between two contacting particles when inference (overlap) occurs. The key new feature of the algorithm is a very efficient and effective multilevel contact detection scheme that makes it possible to track the behavior of much larger assemblies of polygonal particles than has been possible in the past. Examples involving large assemblies of particles are presented to show the capabilities of the method for (1) analyzing quasi static assemblies of particles subjected to stress (such as soil or rock masses), and (2) investigating dynamic particulate flows (such as flows through hoppers and gates). The algorithm may be used to conduct analyses of slip and failure processes in geologic materials and for investigating fracture and fatigue of metals.