Discrete element computation : algorithms and architecture

Abstract

The Discrete Element Method is a numerical technique used to model physical phenomena through the dynamic interactions of a large number of distinct bodies. The strength of the method lies in its ability to accurately model the behavior of inherently discontinuous media, such as granular, fractured, or powdered materials. The major computational obstacle in discrete element simulation is the automatic detection of contacts between bodies. For large simulations, the complexity of the contact detection process is driven by the general spatial reasoning problem of neighbor searching, in which candidate intersection pairs are selected based on their proximity. Neighbor search algorithms exist that exhibit linear scaling in the number of bodies. These algorithms rely, however, on the assumption of uniformly sized objects. Devaitions from this assuption, inherent in many common physical systems, significantly degrade performance. This thesis presents a new grid-based algorithm which accomodates objects of varying size. A new grid-based neighbor search algorithm, called CGrid, is developed to deal with objects of varying sizes. A generic formulation for any number of dimensions is presented. CGrid scales linearly in the number of bodies, and is less sensitive to object size disparity than existing linear algorithms. By combining performance and robustness, CGrid provides a reliable neighbor search solution for general simulation systems. An architecture for simulation is presented, which is designed to support rapid prototyping and extension development.. The core architecture provides an infrastructure of generic components for simulation management. The simulation object heirarchy is constructed to address the issues associated with developing extension capabilities, and supporting the wide variety of objects and behaviors which can be employed within the Discrete Element Method.