Upcoming: CAAPS event on Julia for scientific computing

On Wednesday, 18th December 2024, 4pm, we host the CAAPS Connect event "Julia for Scientific Computing and Data Science" at the University of Augsburg. The idea is to bring together scientists who already use Julia (or are interested in doing so) for their research. The event is co-organized with Tatjana Stykel of the Chair for Computational Mathematics and takes place at the building I2, room 1309, at the University of Augsburg.

No registration is required. For more details, please visit the event website. We are looking forward to seeing you there!

Together with Erik Faulhaber, Sven Berger, Christian Weißenfels und Gregor Gassner, we have submitted our paper "Robust and efficient pre-processing techniques for particle-based methods including dynamic boundary generation".

 

arXiv:2506.21206 reproduce me!

 

 

Abstract

Obtaining high-quality particle distributions for stable and accurate particle-based simulations poses significant challenges, especially for complex geometries. We introduce a preprocessing technique for 2D and 3D geometries, optimized for smoothed particle hydrodynamics (SPH) and other particle-based methods. Our pipeline begins with the generation of a resolution-adaptive point cloud near the geometry's surface employing a face-based neighborhood search. This point cloud forms the basis for a signed distance field, enabling efficient, localized computations near surface regions. To create an initial particle configuration, we apply a hierarchical winding number method for fast and accurate inside-outside segmentation. Particle positions are then relaxed using an SPH-inspired scheme, which also serves to pack boundary particles. This ensures full kernel support and promotes isotropic distributions while preserving the geometry interface. By leveraging the meshless nature of particle-based methods, our approach does not require connectivity information and is thus straightforward to integrate into existing particle-based frameworks. It is robust to imperfect input geometries and memory-efficient without compromising performance. Moreover, our experiments demonstrate that with increasingly higher resolution, the resulting particle distribution converges to the exact geometry.

Search