Effective packing of 3-dimensional voxel-based arbitrarily shaped particles

A1 Journal article (refereed)


Internal Authors/Editors


Publication Details

List of Authors: Byholm T, Toivakka M, Westerholm J
Publisher: ELSEVIER SCIENCE SA
Publication year: 2009
Journal: Powder Technology
Journal acronym: POWDER TECHNOL
Volume number: 196
Issue number: 2
Start page: 139
End page: 146
Number of pages: 8
ISSN: 0032-5910


Abstract

In many research areas including medicine and paper coating, packing of particles together with numerical simulation is used for understanding important material functionalities such as optical and mass transfer properties. Computational packing of particles allows for analysing those problems not possible or difficult to approach experimentally, e.g., the influence of various shapes and size distributions of particles. In this paper a voxel-based algorithm by Jia et all. [X Jia, R.A. Williams, A packing algorithm for particles of arbitrary shapes, Powder Technology 2001, vol. 120, pp. 175-186.] enabling the packing of arbitrarily shaped particles, is memory- and speed-optimised to allow for simulating significantly larger problems than before. Algorithmic optimisation is carried out using particle shell area reduction decreasing the amount of time spent on collision detection, fast rotation routines including lookup tables, and a bit packing algorithm to utilise memory effectively. Presently several hundreds of thousands of complex arbitrarily shaped particles can be simulated on a desktop machine in a simulation box consisting of more than 109 voxels.


Keywords

Digital, Optimisation, Particle packing, Voxel

Last updated on 2019-21-10 at 02:37