Closed matthiasto closed 3 years ago
Other alternatives: https://cg.informatik.uni-freiburg.de/publications/2011_CGF_dataStructuresSPH.pdf @article{https://doi.org/10.1111/j.1467-8659.2010.01832.x, author = {Ihmsen, Markus and Akinci, Nadir and Becker, Markus and Teschner, Matthias}, title = {A Parallel SPH Implementation on Multi-Core CPUs}, journal = {Computer Graphics Forum}, volume = {30}, number = {1}, pages = {99-112}, keywords = {fluid animation, smoothed particle hydrodynamics, neighborhood search, parallel data structures, I.3.7 Computer Graphics: Three-Dimensional Graphics and Realism: Animation}, doi = {https://doi.org/10.1111/j.1467-8659.2010.01832.x}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-8659.2010.01832.x}, eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1111/j.1467-8659.2010.01832.x}, year = {2011} }
Now the SPH kernel length can be chosen independently from the DEM grid size. A SPH virtual grid based on the extend of the DEM and the SPH kernel length is build.
How do we store the information about which particle is in which cell? This is useful to compute the sph interpolation of a quantity. So far the method implemented is very close to the one used in samosAT. (SW_simution.cpp, line 2871, line 2509)