Constrained neighbor lists for SPH-based fluid simulations

In this paper we present a new approach to create neighbor lists with strict memory bounds for incompressible Smoothed Particle Hydrodynamics (SPH) simulations. Our proposed approach is based on a novel efficient predictive-corrective algorithm that locally adjusts particle support radii in order to yield neighborhoods of a user-defined maximum size. Due to the improved estimation of the initial support radius, our algorithm is able to efficiently calculate neighborhoods in a single iteration in almost any situation. We compare our neighbor list algorithm to previous approaches and show that our proposed approach can handle larger particle numbers on a single GPU due to its strict guarantees and is able to simulate more particles in real time due to its benefits in regard to performance. Additionally we demonstrate the versatility and stability of our approach in several different scenarios, for example multi-scale simulations and with different kernel functions.

[1]  Matthias Teschner,et al.  SPH Fluids in Computer Graphics , 2014, Eurographics.

[2]  Moncho Gómez-Gesteira,et al.  Neighbour lists in smoothed particle hydrodynamics , 2011 .

[3]  Giacomo Viccione,et al.  Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations , 2008 .

[4]  J. Monaghan.  Smoothed particle hydrodynamics , 2005 .

[5]  Markus H. Gross,et al.  Particle-based fluid simulation for interactive applications , 2003, SCA '03.

[6]  Simon Green,et al.  Particle Simulation using CUDA , 2010 .

[7]  L. Hernquist,et al.  TREESPH: A Unification of SPH with the Hierarchical Tree Method , 1989 .

[8]  L. Verlet.  Computer "Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules , 1967 .

[9]  J. Monaghan,et al.  Smoothed particle hydrodynamics: Theory and application to non-spherical stars , 1977 .

[10]  Renato Pajarola,et al.  Interactive SPH simulation and rendering on the GPU , 2010, SCA '10.

[11]  Andreas Kolb,et al.  Consistent surface model for SPH-based fluid transport , 2013, SCA '13.

[12]  Prashant Goswami,et al.  Implicit Incompressible SPH on the GPU , 2015, VRIPHYS.

[13]  Matthias Teschner,et al.  Versatile surface tension and adhesion for SPH fluids , 2013, ACM Trans. Graph..

[14]  Markus Gross,et al.  Two-scale particle simulation , 2011, SIGGRAPH 2011.

[15]  W. Dehnen,et al.  Improving convergence in smoothed particle hydrodynamics simulations without pairing instability , 2012, 1204.2471.

[16]  Jan Bender,et al.  Divergence-free smoothed particle hydrodynamics , 2015, Symposium on Computer Animation.

[17]  Andreas Kolb,et al.  Temporal Blending for Adaptive SPH , 2012, Comput. Graph. Forum.

[18]  Matthias Teschner,et al.  A Parallel SPH Implementation on Multi‐Core CPUs , 2011, Comput. Graph. Forum.

[19]  J. Monaghan.  Smoothed particle hydrodynamics , 2005 .

[20]  Matthias Teschner,et al.  Versatile rigid-fluid coupling for incompressible SPH , 2012, ACM Trans. Graph..

[21]  Miguel Sainz,et al.  Screen space fluid rendering with curvature flow , 2009, I3D '09.

[22]  L. Lucy.  A numerical approach to the testing of the fission hypothesis. , 1977 .

[23]  Alexander Khoperskov,et al.  Smoothed-Particle Hydrodynamics Models: Implementation Features on GPUs , 2017, RuSCDays.

[24]  Miles Macklin,et al.  Position based fluids , 2013, ACM Trans. Graph..

[25]  Pedro Gonnet,et al.  Efficient and Scalable Algorithms for Smoothed Particle Hydrodynamics on Hybrid Shared/Distributed-Memory Architectures , 2014, SIAM J. Sci. Comput..

[26]  Renato Pajarola,et al.  Eurographics/ Acm Siggraph Symposium on Computer Animation (2008) , 2022 .