Steepest descent ballistic deposition of complex shaped particles

Topic N, Pöschel T (2016)


Publication Language: English

Publication Status: Published

Publication Type: Journal article, Original article

Publication year: 2016

Journal

Book Volume: 308

Pages Range: 421-437

DOI: 10.1016/j.jcp.2015.12.052

Abstract

We present an efficient event-driven algorithm for sequential ballistic deposition of complex-shaped rigid particles. Each of the particles is constructed from hard spheres (typically 5.1000) of variable radii. The sizes and relative positions of the spheres may mutually overlap and can be chosen such that the surface of the resulting particle appears relatively smooth. In the sequential deposition process, by performing steps of rolling and linear motion, the particles move along the steepest descent in a landscape formed by the boundaries and previously deposited particles. The computer time for the simulation of a deposition process depends on the total number of spheres but only weakly on the sizes and shapes of the particles. The proposed algorithm generalizes the Visscher-Bolsterli algorithm [1] which is frequently used for packing of spheres, to non-spherical particles. The proposed event-driven algorithm allows simulations of multi-million particle systems using desktop computers.

Authors with CRIS profile

Additional Organisation(s)

How to cite

APA:

Topic, N., & Pöschel, T. (2016). Steepest descent ballistic deposition of complex shaped particles. Journal of Computational Physics, 308, 421-437. https://dx.doi.org/10.1016/j.jcp.2015.12.052

MLA:

Topic, Nikola, and Thorsten Pöschel. "Steepest descent ballistic deposition of complex shaped particles." Journal of Computational Physics 308 (2016): 421-437.

BibTeX: Download