A fast multilevel algorithm for contact detection of arbitrarily polydisperse objects


Ogarko, V. and Luding, S. (2012) A fast multilevel algorithm for contact detection of arbitrarily polydisperse objects. Computer physics communications, 183 (4). 931 - 936. ISSN 0010-4655

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract: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.
Item Type:Article
Copyright:© 2012 Elsevier
Engineering Technology (CTW)
Research Group:
Link to this item:http://purl.utwente.nl/publications/80399
Official URL:https://doi.org/10.1016/j.cpc.2011.12.019
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 294336