SPH - a comparison of neighbor search methods based on constant number of neighbors and constant cut-off radius

Two methods of neighbor search for the SPH algorithm are presented, based on a constant number of neighbors and a constant cut-off radius. First, feasible methods of comparison were analyzed. Then, the two selected methods were compared visually and computationally. Considering the use of the SPH algorithm for simulating incompressible fluids, the obtained results suggest that the method with a constant cut-off radius is better than that with a constant number of neighbors. The simulation results of both methods are practically indistinguishable, while the computational costs favor one of them.