1994
DOI: 10.1007/bf00451748
|View full text |Cite
|
Sign up to set email alerts
|

Computer simulation of isostatic powder compaction by random packing of monosized particles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2004
2004
2019
2019

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 12 publications
0
13
0
Order By: Relevance
“…how closely these spheres are packed. For random close packing of spheres of uniform size, the highest packing density that can be achieved is 0.6366 ± 0.005 [39,40].…”
Section: Random Close Packingmentioning
confidence: 94%
See 1 more Smart Citation
“…how closely these spheres are packed. For random close packing of spheres of uniform size, the highest packing density that can be achieved is 0.6366 ± 0.005 [39,40].…”
Section: Random Close Packingmentioning
confidence: 94%
“…Indeed, random close packing of spheres is a useful approach for numerous material modelling scenarios, such as powder compaction [38,39] and polycrystalline structure simulation [18]. As discussed early, random close packing of spheres is also essential for the construction of Laguerre tessellations.…”
Section: Random Close Packingmentioning
confidence: 99%
“…The main dynamic methods described in the literature are the iterative growth algorithm [22,41] and the isotropic compression [2,25]. These dynamic methods can satisfactorily reproduce the real packing properties [21,44], but require high time-consuming computation.…”
Section: Introductionmentioning
confidence: 98%
“…5.6 near the base. For the packing of mono-sized spheres, it has been established that decreasing porosity results in an increase in mean coordination number [18,23]. Consequently, this implies that packing structure differs by locations with denser packing existing in the centre region.…”
Section: 21mentioning
confidence: 97%