Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 96 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 455 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Algorithms for uniform particle initialization in domains with complex boundaries (1910.07898v3)

Published 17 Oct 2019 in physics.comp-ph and cs.CG

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.

Citations (3)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.