A fast multilevel algorithm for contact detection of arbitrarily polydisperse objects

An efficient algorithm for contact detection among many arbitrarily sized objects is developed. Objects are allocated to cells based on their location and size within a nested hierarchical cell space. The choice of optimal cell sizes and the number of hierarchies for best performance is not trivial in most cases. To overcome this challenge, a novel analytical method to determine the optimal hierarchical cell space for a given object size distribution is presented. With this, a decision can be made between using the classical Linked-Cell method and the contact detection algorithm presented. For polydisperse systems with size ratios up to 50, we achieved 220 times speed-up compared to the classical Linked-Cell method. For larger size ratios, even better speed-up is expected. The complexity of the algorithm is linear with the number of objects when the optimal hierarchical cell space is chosen. So that the problem of contact detection in polydisperse systems essentially is solved.

[1]  Jane Wilhelms,et al.  Number 4 , August 1988 Collision Detection and Response for Computer Animation , 1988 .

[2]  R W Hockney,et al.  Computer Simulation Using Particles , 1966 .

[3]  Rintoul,et al.  Metastability and Crystallization in Hard-Sphere Systems. , 1996, Physical review letters.

[4]  S Luding,et al.  Cluster growth in two- and three-dimensional granular gases. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  J. Williams,et al.  Discrete element simulation and the contact problem , 1999 .

[6]  Yoshiyuki Shirakawa,et al.  Optimum Cell Condition for Contact Detection Having a Large Particle Size Ratio in the Discrete Element Method , 2006 .

[7]  S. Luding,et al.  Equation of state and jamming density for equivalent bi- and polydisperse, smooth, hard sphere systems. , 2012, The Journal of chemical physics.

[8]  S. Savage,et al.  Particle size segregation in inclined chute flow of dry cohesionless granular solids , 1988, Journal of Fluid Mechanics.

[9]  John F. Peters,et al.  A hierarchical search algorithm for discrete element method of greatly differing particle sizes , 2009 .

[10]  Michael Kolonko,et al.  A hierarchical approach to simulate the packing density of particle mixtures on a computer , 2010 .

[11]  Brian Mirtich,et al.  Efficient Algorithms for Two-Phase Collision Detection , 1997 .

[12]  Lixu Gu,et al.  Hierarchical Spatial Hashing for Real-time Collision Detection , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).

[13]  Ante Munjiza.  Processing of Contact Interaction in the Combined Finite Discrete Element Method , 2004 .

[14]  Christer Ericson,et al.  Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology) (The Morgan Kaufmann Series in Interactive 3D Technology) , 2004 .

[15]  A. Gast,et al.  Simple Ordering in Complex Fluids , 1998 .

[16]  Monica L. Skoge,et al.  Packing hyperspheres in high-dimensional Euclidean spaces. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Yves Tillé,et al.  Sampling Algorithms , 2011, International Encyclopedia of Statistical Science.

[18]  Michael Kolonko,et al.  A comparison of data structures for the simulation of polydisperse particle packings , 2011 .

[19]  Jörg Stadler,et al.  IMD: A Software Package for Molecular Dynamics Studies on Parallel Computers , 1997 .

[20]  Steve Plimpton,et al.  Fast parallel algorithms for short-range molecular dynamics , 1993 .

[21]  T. Iwai,et al.  FAST PARTICLE PAIR DETECTION ALGORITHMS FOR PARTICLE SIMULATIONS , 1999 .

[22]  D. C. Rapaport,et al.  Large-scale molecular dynamics simulation using vector and parallel computers , 1988 .

[23]  S. Luding,et al.  A study on the influence of the particle packing fraction on the performance of a multilevel contact detection algorithm , 2011 .

[24]  A. Thornton,et al.  A theory for particle size segregation in shallow granular free-surface flows , 2005, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[25]  G. Grest,et al.  Granular flow down an inclined plane: Bagnold scaling and rheology. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  B. Lubachevsky,et al.  Geometric properties of random disk packings , 1990 .

[27]  P. Cundall,et al.  A discrete numerical model for granular assemblies , 1979 .

[28]  Christer Ericson,et al.  Real-Time Collision Detection , 2004 .

[29]  I. R. Mcdonald,et al.  Theory of simple liquids , 1998 .

[30]  Nobuyasu Ito,et al.  VECTORIZED AND PARALLELIZED ALGORITHMS FOR MULTI-MILLION PARTICLE MD-SIMULATION , 1993 .

[31]  J. Monaghan,et al.  Smoothed particle hydrodynamics: Theory and application to non-spherical stars , 1977 .

[32]  S. Luding.  Cohesive, frictional powders: contact models for tension , 2008 .

[33]  Jane Wilhelms,et al.  Collision Detection and Response for Computer Animation , 1988, SIGGRAPH.

[34]  Vitaliy Ogarko,et al.  Data structures and algorithms for contact detection in numerical simulation of discrete particle systems , 2010 .

[35]  Stefan Luding,et al.  Towards dense, realistic granular media in 2D , 2009 .

[36]  J. Jenkins,et al.  Segregation in binary mixtures under gravity. , 2002, Physical review letters.