Pith. sign in

REVIEW

Algorithms for uniform particle initialization in domains with complex boundaries

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.07898 v3 pith:L2R6E4A5 submitted 2019-10-17 physics.comp-ph cs.CG

Algorithms for uniform particle initialization in domains with complex boundaries

classification physics.comp-ph cs.CG
keywords particleuniformaccurateboundariesalgorithmcomplexdistributionfluid
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Accurate mesh-free simulation of fluid flows involving complex boundaries requires that the boundaries be captured accurately in terms of particles. In the context of incompressible/weakly-compressible fluid flow, the SPH method is more accurate when the particle distribution is uniform. Hence, for the time accurate simulation of flow in the presence of complex boundaries, one must have both an accurate boundary discretization as well as a uniform distribution of particles to initialize the simulation. This process of obtaining an initial uniform distribution of particles is called "particle packing". In this paper, various particle packing algorithms present in the literature are implemented and compared. An improved SPH-based algorithm is proposed which produces uniform particle distributions of both the fluid and solid domains in two and three dimensions. Some challenging geometries are constructed to demonstrate the accuracy of the new algorithm. The implementation of the algorithm is open source and the manuscript is fully reproducible.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.