TY - JOUR T1 - Improving Linked-Lists Using Tree Search Algorithms for Neighbor Finding in Variable-Resolution Smoothed Particle Hydrodynamics AU - Shahab Khorasanizade & J. M. M. Sousa JO - Communications in Computational Physics VL - 1 SP - 57 EP - 86 PY - 2019 DA - 2019/02 SN - 26 DO - http://doi.org/10.4208/cicp.OA-2018-0158 UR - https://global-sci.org/intro/article_detail/cicp/13026.html KW - Smoothed particle hydrodynamics, linked-list, quadtree, neighbor finding, variable resolution. AB -

Improving linked-lists for neighbor finding with the use of tree search algorithms is proposed here, aiming to cope with highly non-uniform resolution simulations employing a meshless method. The new procedure, coined Quadtree Cells Grid, has been implemented in Smoothed Particle Hydrodynamics (SPH). The SPH scheme employed is adaptive, thus allowing for particle refinement in desired regions of the flow. Owing to the wide range of coexisting particle mass levels, standard linked-list neighbor search algorithms become ineffective. Hence, an alternative is found based on the use of hierarchical data structures, using quadtrees (in 2D problems). The present algorithm exploits the advantages of both linked-lists and quadtree methods with the goal of increasing computational efficiency, when dealing with highly non-uniform particle distributions. Test cases involving two distinct flow problems have demonstrated that the computational cost of the current adaptive neighbor finding algorithm scales linearly with the total number of particles, thus retrieving this characteristic of linked-lists in uniform grid search. Nevertheless, the memory usage increased as a result of the more complex data structure.