TY - JOUR
T1 - Efficient Implementation of Smoothed Particle Hydrodynamics (SPH) with Plane Sweep Algorithm
AU - Dong Wang, Yisong Zhou & Sihong Shao
JO - Communications in Computational Physics
VL - 3
SP - 770
EP - 800
PY - 2018
DA - 2018/04
SN - 19
DO - http://doi.org/10.4208/cicp.010415.110915a
UR - https://global-sci.org/intro/article_detail/cicp/11109.html
KW - 
AB - <p style="text-align: justify;">Neighbour search (NS) is the core of any implementations of smoothed particle
hydrodynamics (SPH). In this paper, we present an efficient&nbsp;$\mathcal{O}$($N$log$N$) neighbour
search method based on the plane sweep (PW) algorithm with $N$ being the number of
SPH particles. The resulting method, dubbed the PWNS method, is totally independent
of grids (i.e., purely meshfree) and capable of treating variable smoothing length,
arbitrary particle distribution and heterogenous kernels. Several state-of-the-art data
structures and algorithms, e.g., the segment tree and the Morton code, are optimized
and implemented. By simply allowing multiple lines to sweep the SPH particles simultaneously
from different initial positions, a parallelization of the PWNS method with
satisfactory speedup and load-balancing can be easily achieved. That is, the PWNS
SPH solver has a great potential for large scale fluid dynamics simulations.</p>