Predicting Packing Characteristics of Particles of Arbitrary Shapes
A computer model for particle packing is of importance in both theories and applications. By taking a very different approach from existing packing algorithms, our digital packing algorithm – called DigiPac – is able to avoid many of the diffi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hosokawa Powder Technology Foundation
2014-03-01
|
| Series: | KONA Powder and Particle Journal |
| Online Access: | https://www.jstage.jst.go.jp/article/kona/22/0/22_2004012/_pdf/-char/en |
| Summary: | A computer model for particle packing is of importance in both theories and applications. By taking a very different approach from existing packing algorithms, our digital packing algorithm – called DigiPac – is able to avoid many of the difficulties normally encountered by the conventional algorithms in dealing with non-spherical particles. Using the digital approach, it is easy to pack particles of arbitrary shapes and sizes into a container of any geometry. This paper briefly describes the digital packing algorithm, but the focus is on validation of the DigiPac model through several case studies involving mono-sized non-spherical particles and also powders with different size distributions. Packing densities from DigiPac simulations are compared with those measured experimentally by ourselves in some cases and in others with data published in the literature using other models. The results show a good agreement in all the cases, which enhances our confidence in DigiPac that despite being a geometrical packing algorithm with no explicit consideration of particle interactions, it is able to predict quite accurately the packing structure of particulates whose shapes are commonly encountered in both industry and everyday life. |
|---|---|
| ISSN: | 0288-4534 2187-5537 |