Journals - MOST Wiedzy

Your account

TASK Quarterly
  1. Home Page
  2. TASK Quarterly
  3. Vol. 11 No. 3 (2007)
  4. SPH – A COMPARISON OF NEIGHBOR SEARCH METHODS BASED ON CONSTANT NUMBER OF NEIGHBORS AND CONSTANT CUT-OFF RADIUS

SPH – A COMPARISON OF NEIGHBOR SEARCH METHODS BASED ON CONSTANT NUMBER OF NEIGHBORS AND CONSTANT CUT-OFF RADIUS

Abstract

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.

Keywords:

SPH, simulations, incompressible fluids, constant cut-off radius method, constant number of neighbors method, breaking dam, side gap, time effectiveness

Details

Issue
Vol. 11 No. 3 (2007)
Section
Research article
Published
2007-09-30
Licencja:
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Author Biographies

PAWEŁ WRÓBLEWSKI,
AGH University of Science and Technology, Department of Computer Science



MARIUSZ KOPEĆ,
AGH University of Science and Technology, Faculty of Physics and Applied Computer Science



Authors

  • PAWEŁ WRÓBLEWSKI

    AGH University of Science and Technology, Department of Computer Science

  • MARIUSZ KOPEĆ

    AGH University of Science and Technology, Faculty of Physics and Applied Computer Science

  • KRZYSZTOF BORYCZKO

    AGH University of Science and Technology, Department of Computer Science

Download paper

pdf